Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -54,6 +54,7 @@
- [q43_字符串相乘](/src/数字操作/q43_字符串相乘)
- [q172_阶乘后的零](/src/数字操作/q172_阶乘后的零)
- [q258_各位相加](/src/数字操作/q258_各位相加)
- [q1920_基于排列构建数组](/src/数字操作/q1920_基于排列构建数组)

### 数组操作

Expand Down
1 change: 1 addition & 0 deletions README_EN.md
Original file line number Diff line number Diff line change
Expand Up @@ -54,6 +54,7 @@
- [Question 43 : Multiply Strings](/src/数字操作/q43_字符串相乘)
- [Question 172 : Factorial Trailing Zeroes](/src/数字操作/q172_阶乘后的零)
- [Question 258 : Add Digits](/src/数字操作/q258_各位相加)
- [Question 1920 : Build Array from Permutation](/src/数字操作/q1920_基于排列构建数组)

### Array Operations

Expand Down
23 changes: 23 additions & 0 deletions src/数字操作/q1920_基于排列构建数组/Solution.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
package 数字操作.q1920_基于排列构建数组;

/**
* 注意观察题目,数组中数字为[0,999]闭区间
*/
class Solution {
public int[] buildArray(int[] nums) {
int n = nums.length;
for (int i = 0; i < n; i++) {
nums[i] += 1000 * (nums[nums[i]] % 1000);
System.out.println(nums[i]);
}
for (int i = 0; i < n; i++) {
nums[i] /= 1000;
}
return nums;
}

public static void main(String[] args) {
int[] nums = new int[]{3, 2, 0, 1, 4};
new Solution().buildArray(nums);
}
}