We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8706eb8 commit ccfd369Copy full SHA for ccfd369
src/main/java/g3301_3400/s3379_transformed_array/Solution.java
@@ -7,9 +7,6 @@ public int[] constructTransformedArray(int[] nums) {
7
int n = nums.length;
8
int[] res = new int[n];
9
for (int i = 0; i < n; i++) {
10
- if (nums[i] == 0) {
11
- res[i] = nums[i];
12
- }
13
if (nums[i] > 0) {
14
res[i] = nums[(i + nums[i]) % n];
15
} else if (nums[i] < 0) {
0 commit comments