Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an ...

Given an array like nums = [1, 2, 3], the next permutation is [1, 3, 2]. If it's the last permutation like [3, 2, 1], then the next should be the smallest one: [1, 2, 3]. Steps: 1.Find the first index ...