Leetcode——667. Beautiful Arrangement II

题目原址

https://leetcode.com/problems/beautiful-arrangement-ii/description/

题目描述

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.

Example1：

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.

Example2：

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：

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

解题思路

题中给定另个数字，一个是n和一个数字k，题目希望找出一种排列方式，使得1到n组成的数组中相邻两个数的差的绝对值正好有k种。给了k和n的关系为k

AC代码

class Solution {
    public int[] constructArray(int n, int k) {
        int[] ret = new int[n];

        int start = 1, end = n;
        int i = 0;

        while(start <= end) {
            if(k > 1)
                ret[i++] = (k-- % 2 != 0) ? start++ : end--;
            else
                ret[i++] = start ++;
        }
        return ret;      
    }
}

参考

http://www.cnblogs.com/grandyang/p/7577878.html