-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path3379.transformed-array.py
More file actions
55 lines (53 loc) · 2.1 KB
/
3379.transformed-array.py
File metadata and controls
55 lines (53 loc) · 2.1 KB
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
53
54
55
# Tag: Array, Simulation
# Time: O(N)
# Space: O(1)
# Ref: -
# Note: -
# You are given an integer array nums that represents a circular array. Your task is to create a new array result of the same size, following these rules:
# For each index i (where 0 <= i < nums.length), perform the following independent actions:
#
#
# If nums[i] > 0: Start at index i and move nums[i] steps to the right in the circular array. Set result[i] to the value of the index where you land.
# If nums[i] < 0: Start at index i and move abs(nums[i]) steps to the left in the circular array. Set result[i] to the value of the index where you land.
# If nums[i] == 0: Set result[i] to nums[i].
#
# Return the new array result.
# Note: Since nums is circular, moving past the last element wraps around to the beginning, and moving before the first element wraps back to the end.
#
# Example 1:
#
# Input: nums = [3,-2,1,1]
# Output: [1,1,1,3]
# Explanation:
#
# For nums[0] that is equal to 3, If we move 3 steps to right, we reach nums[3]. So result[0] should be 1.
# For nums[1] that is equal to -2, If we move 2 steps to left, we reach nums[3]. So result[1] should be 1.
# For nums[2] that is equal to 1, If we move 1 step to right, we reach nums[3]. So result[2] should be 1.
# For nums[3] that is equal to 1, If we move 1 step to right, we reach nums[0]. So result[3] should be 3.
#
#
# Example 2:
#
# Input: nums = [-1,4,-1]
# Output: [-1,-1,4]
# Explanation:
#
# For nums[0] that is equal to -1, If we move 1 step to left, we reach nums[2]. So result[0] should be -1.
# For nums[1] that is equal to 4, If we move 4 steps to right, we reach nums[2]. So result[1] should be -1.
# For nums[2] that is equal to -1, If we move 1 step to left, we reach nums[1]. So result[2] should be 4.
#
#
#
# Constraints:
#
# 1 <= nums.length <= 100
# -100 <= nums[i] <= 100
#
#
class Solution:
def constructTransformedArray(self, nums: List[int]) -> List[int]:
n = len(nums)
res = [0 for i in range(n)]
for i in range(n):
res[i] = nums[(i + nums[i]) % n]
return res