Skip to content

Commit b4f29aa

Browse files
author
oleg.vlasov
committed
fix format
1 parent 860defb commit b4f29aa

2 files changed

Lines changed: 8 additions & 11 deletions

File tree

.gitignore

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,3 @@
11
*.iml
2-
.idea
2+
.idea
3+
out

src/arrays/Problem1920.java

Lines changed: 6 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -3,29 +3,25 @@
33
public class Problem1920 {
44
//https://leetcode.com/problems/build-array-from-permutation/
55

6-
7-
public static void main(String[] args) {
6+
public static void main(final String[] args) {
87
final int[] nums = {5, 0, 1, 2, 3, 4};
98
final int[] ans = buildArray(nums);
10-
119
}
1210

1311
public static int[] buildArray(final int[] nums) {
14-
// final int ans[] = new int[nums.length];
15-
final int value = -1;
12+
final int[] ans = new int[nums.length];
1613
if (1 <= nums.length && nums.length <= 1000) {
1714
for (int i = 0; i < nums.length; i++) {
1815
if (0 <= nums[i] && nums[i] < nums.length) {
19-
20-
16+
ans[i] = nums[nums[i]];
2117
}
2218
}
2319
}
24-
return nums;
20+
return ans;
2521
}
2622

27-
public static int[] buildArray2(int[] nums) {
28-
int l = nums.length;
23+
public static int[] buildArray2(final int[] nums) {
24+
final int l = nums.length;
2925
for (int i = 0; i < l; i++) {
3026
nums[i] = nums[i] + l * (nums[nums[i]] % l);
3127
}

0 commit comments

Comments
 (0)