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.

问题描述：

给定两个数，第一个数表示数列的个数。第二个数表示相邻两个数差的绝对值的个数。

解决方法：

n，最大k是 n-1.k=n-1实现的方式是，大的值和小的值依次排列。

当k不是n-1的时候，可以先排列出 k-1给数据的序列，然后把剩下的值放到系统中。剩下的数值排列的过程主要是依次递增或者是依次递减来实现的。

实现代码：

public int[] constructArray(int n, int k) {

    int[] result = new int[n];// 返回结果
    int min = 1;
    int max = n;
    boolean isMax = true;
    for (int i = 0; i < n; i++) {//开始选择大小的值
        if (k == 1) {//如果需要最后一个
            if (isMax) {
                result[i] = max;
                max--;
            } else {
                result[i] = min;
                min++;
            }
        } else {
            if (isMax) {
                result[i] = max;
                max--;
                isMax = false;
            } else {
                result[i] = min;
                min++;
                isMax = true;
            }

            k--;
        }
    }
    return result;
}

实现当中，用一个max表示应该设置大的值和小的值，这里一次设置了一个值。还有一种做法是一次就设定两个值，然后看下剩下的值是0，还是1来决定应该是升序排列还是降序排列。