-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patharray_permutation.py
52 lines (44 loc) · 1.59 KB
/
array_permutation.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
"""
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 array of distinct integers from 0 to nums.length - 1 (inclusive).
Example 1:
Input: nums = [0,2,1,5,3,4]
Output: [0,1,2,4,5,3]
Explanation: The array ans is built as follows:
ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
= [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]]
= [0,1,2,4,5,3]
Example 2:
Input: nums = [5,0,1,2,3,4]
Output: [4,5,0,1,2,3]
Explanation: The array ans is built as follows:
ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
= [nums[5], nums[0], nums[1], nums[2], nums[3], nums[4]]
= [4,5,0,1,2,3]
"""
'''
nums = [0,2,1,5,3,4]
-> get the length of array (0 indexed). in this case, it is - 5.
-> till the length of array - get the
-> nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]
-> nums[nums[0]]
'''
from typing import List
class Solution:
def buildArray(self, nums: List[int]) -> List[int]:
result = []
for i in range(0, len(nums)):
result.append(nums[nums[i]])
return result
#another solution
'''class Solution:
def buildArray(self, nums: List[int]) -> List[int]:
ans = []
for num in range(len(nums)):
value_check = nums[num]
ans.append(nums[value_check])
return ans'''
sol = Solution()
nums = [5,0,1,2,3,4]
print(sol.buildArray(nums))