Skip to content

Commit ba523eb

Browse files
author
guangxin.yuan
committed
add q1920
1 parent 6e56ef6 commit ba523eb

File tree

3 files changed

+25
-0
lines changed

3 files changed

+25
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -54,6 +54,7 @@
5454
- [q43_字符串相乘](/src/数字操作/q43_字符串相乘)
5555
- [q172_阶乘后的零](/src/数字操作/q172_阶乘后的零)
5656
- [q258_各位相加](/src/数字操作/q258_各位相加)
57+
- [q1920_基于排列构建数组](/src/数字操作/q1920_基于排列构建数组)
5758

5859
### 数组操作
5960

README_EN.md

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

5859
### Array Operations
5960

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
package 数字操作.q1920_基于排列构建数组;
2+
3+
/**
4+
* 注意观察题目,数组中数字为[0,999]闭区间
5+
*/
6+
class Solution {
7+
public int[] buildArray(int[] nums) {
8+
int n = nums.length;
9+
for (int i = 0; i < n; i++) {
10+
nums[i] += 1000 * (nums[nums[i]] % 1000);
11+
System.out.println(nums[i]);
12+
}
13+
for (int i = 0; i < n; i++) {
14+
nums[i] /= 1000;
15+
}
16+
return nums;
17+
}
18+
19+
public static void main(String[] args) {
20+
int[] nums = new int[]{3, 2, 0, 1, 4};
21+
new Solution().buildArray(nums);
22+
}
23+
}

0 commit comments

Comments
 (0)