Leetcode 667. Beautiful Arrangement II

题目

链接：https://leetcode.com/problems/beautiful-arrangement-ii/

Level: Medium

Discription:
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.

Note:

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

代码

class Solution {
public:
    vector<int> constructArray(int n, int k) {
        vector<int> ret;
        ret.push_back(1);
        int num=1;
        for(int i=k;i>=1;i--)
        {
            ret.push_back(ret.back()+i*num);
            num*=-1;
        }
        for(int i=k+2;i<=n;i++)
        {
             ret.push_back(i);
        }
        return ret;
    }
};

思考

• 算法时间复杂度为O(N),空间复杂度为O(1)，不算输出所占空间。
• 这题比较简单，找规律，只需要一种序列即可。

转载于:https://www.cnblogs.com/zuotongbin/p/10214943.html