-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
667.java
40 lines (38 loc) · 1.19 KB
/
667.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public int[] constructArray(int n, int k) {
int[] result = new int[n];
int index = 0;
int x = 1, y = k + 1;
while (x <= y) {
result[index++] = x++;
if (x < y) {
result[index++] = y--;
}
}
for (int i = index + 1; i <= n; i++) {
result[index++] = i;
}
return result;
}
}
__________________________________________________________________________________________________
sample 34432 kb submission
class Solution {
public int[] constructArray(int n, int k) {
int[] ret = new int[n];
int left = 1, right = k + 1, count = 0;
while(left < right) {
ret[count ++] = left ++;
ret[count ++] = right --;
}
if(left == right) ret[count ++] = left;
while(count < n) {
ret[count] = count + 1;
count ++;
}
return ret;
}
}
__________________________________________________________________________________________________