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.

示例:

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.

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.

问题分析：

求k的不同的值，我们完全可以在1,2,3...,k+1的范围内取得并按照一定的规则排列好，如①1,k+1,2,k,3,k-1,... ，在①这个序列中，相邻元素差的绝对值为k,k-1,k-2,...,3,2,1。对于剩下的元素序列②k+2,...,n，可依次排列到序列①之后，我们知道k+2这个元素与之前的序列①中相邻的元素绝对值之差最大为k，所以序列①②合并之后可作为一个答案。

过程详见代码：

class Solution {
public:
    vector<int> constructArray(int n, int k) {
       int l = 1, r = k + 1;
		vector<int> res;
		while (l <= r)
		{
			res.emplace_back(l++);
			if (l <= r) res.emplace_back(r--);
		}
		for (int i = k + 2; i <= n; i++) res.emplace_back(i);
		return res;
    }
};