LeetCode 667: Beautiful Arrangement II

最新推荐文章于 2021-10-22 10:57:20 发布

weixin_34321977

最新推荐文章于 2021-10-22 10:57:20 发布

阅读量64

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shuashuashua/p/7500911.html

本文介绍了一种算法，用于构造一个长度为n的整数数组，该数组包含从1到n的所有整数，并且存在恰好k个不同的相邻元素对，使得一对相邻元素的差值不相等。提供了一个具体实现示例。

Note:

k different could be [1, k+1] are in wiggle sort order. Then there are k different numbers. But in this case, the last difference definitely will be 1. So folllowing difference will duplicate with previous.

class Solution {
    public int[] constructArray(int n, int k) {
        int[] result = new int[n];
        int maxValue = k + 1;
        for (int i = 0; i < k + 1; i++) {
            if (i % 2 == 0) {
                result[i] = i / 2 + 1;
            } else {
                result[i] = maxValue - i / 2;
            }
        }
        
        for (int i = k + 1; i < n; i++) {
            result[i] = i + 1;
        }
        return result;
    }
}