g0601_0700.s0667_beautiful_arrangement_ii.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0601_0700.s0667_beautiful_arrangement_ii;
// #Medium #Array #Math
public class Solution {
public int[] constructArray(int n, int k) {
int[] res = new int[n];
int left = 1;
int right = n;
for (int i = 0; i < n; i++) {
res[i] = k % 2 == 0 ? left++ : right--;
if (k > 1) {
k--;
}
}
return res;
}
}