leetcode 667. Beautiful Arrangement II

Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requirement: 
Suppose this list is [a1, a2, a3, ... , an], then the list [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] has exactly k distinct integers.

If there are multiple answers, print any of them.

Example 1:

Input: n = 3, k = 1
Output: [1, 2, 3]
Explanation: The [1, 2, 3] has three different positive integers ranging from 1 to 3, and the [1, 1] has exactly 1 distinct integer: 1.

Example 2:

Input: n = 3, k = 2
Output: [1, 3, 2]
Explanation: The [1, 3, 2] has three different positive integers ranging from 1 to 3, and the [2, 1] has exactly 2 distinct integers: 1 and 2.

Note:

1. The n and k are in the range 1 <= k < n <= 104.

这道题有一定的思维难度。大神的思路是这样的。

if you have n number, the maximum k can be n - 1;
if n is 9, max k is 8.
This can be done by picking numbers interleavingly(交错地) from head and tail,

// start from i = 1, j = n;
// i++, j--, i++, j--, i++, j--

1   2   3   4   5
  9   8   7   6
out: 1 9 2 8 3 7 6 4 5
dif:  8 7 6 5 4 3 2 1

Above is a case where k is exactly n - 1
When k is less than that, simply lay out the rest in incremental
order(all diff is 1). Say if k is 5:

     i++ j-- i++ j--  i++ i++ i++ ...
out: 1   9   2   8    3   4   5   6   7
dif:   8   7   6   5    1   1   1   1 

这是我的解法 based on 上面的思路。

public int[] constructArray(int n, int k) {
	int[] result=new int[n];
	int low=1;
	int high=n;
	int isLowCase=1;
	int i=0;
	for(i=0;i<k;i++){//算 前k个数
		if(isLowCase==1){
			result[i]=low;
			low++;
		}
		else{
			result[i]=high;
			high--;
		}
		isLowCase=1-isLowCase;
	}
	//把 isLowCase 恢复到第k个数的情况 (在i循环中最后被反转了的)
	isLowCase=1-isLowCase;
	
	if(isLowCase==1){
		for(;i<n;i++){
			result[i]=low;
			low++;
		}
	}
	else{
		for(;i<n;i++){
			result[i]=high;
			high--;
		}
	}
	return result;
}

这是大神的解法：

class Solution {
    public int[] constructArray(int n, int k) {
        int[] res = new int[n];
        for (int i = 0, l = 1, r = n; l <= r; i++)
            res[i] = k > 1 ? (k-- % 2 != 0 ? l++ : r--) : (k % 2 != 0? l++ : r--);
        return res;
    }
}

前 k-1 个数需要 k-- ，之后当 k=1 时，就不需要了。