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.
2 parents ca49221 + 8b98ab9 commit 9b5ba26Copy full SHA for 9b5ba26
README.md
@@ -10,6 +10,8 @@ leetcode 测试
10
11
##### 包含的内容如下
12
13
+https://leetcode-cn.com/problems/beautiful-arrangement-ii/
14
+
15
https://leetcode.cn/problems/minimum-moves-to-reach-target-with-rotations/
16
17
https://leetcode.cn/problems/ternary-expression-parser/
beautiful-arrangement-ii/index.ts
@@ -0,0 +1,18 @@
1
+export default function constructArray(n: number, k: number): number[] {
2
3
+ const answer: number[] = new Array(n).fill(0);
4
+ let idx = 0;
5
+ for (let i = 1; i < n - k; ++i) {
6
+ answer[idx] = i;
7
+ ++idx;
8
+ }
9
+ for (let i = n - k, j = n; i <= j; ++i, --j) {
+ if (i !== j) {
+ answer[idx] = j;
+ return answer;
18
+}
0 commit comments