LeetCode 1144：递减元素使数组呈锯齿状（Decrease Elements To Make Array Zigzag）解法汇总

更多LeetCode题解

Given an array nums of integers, a move consists of choosing any element and decreasing it by 1.

An array A is a zigzag array if either:

• Every even-indexed element is greater than adjacent elements, ie. A[0] > A[1] < A[2] > A[3] < A[4] > ...
• OR, every odd-indexed element is greater than adjacent elements, ie. A[0] < A[1] > A[2] < A[3] > A[4] < ...

Return the minimum number of moves to transform the given array nums into a zigzag array.

Example 1:

Input: nums = [1,2,3]
Output: 2
Explanation: We can decrease 2 to 0 or 3 to 1.

Example 2:

Input: nums = [9,6,1,6,2]
Output: 4

Constraints:

• 1 <= nums.length <= 1000
• 1 <= nums[i] <= 1000

Solution

解法很简单，依次比较就行，只是不要忘了每次比较如果更新了count也要更新数组。

class Solution {
public:
    int movesToMakeZigzag(vector<int>& nums) {
        int i = decreaseJi(nums);
        int j = decreaseOu(nums);
        return min(i, j);
    }
    int decreaseOu(vector<int> nums){
        int count=0;
        for(int i=0;i<nums.size();i+=2){
            if(i-1>=0&&nums[i]<=nums[i-1]){
                count+=nums[i-1]-nums[i]+1;
                nums[i-1]=nums[i]-1;
            }
            if(i+1<nums.size()&&nums[i]<=nums[i+1]){
                count+=nums[i+1]-nums[i]+1;
                nums[i+1]=nums[i]-1;
            }
        }
        return count;
    }
    int decreaseJi(vector<int> nums){
        int count=0;
        for(int i=1;i<nums.size();i+=2){
            if(nums[i]<=nums[i-1]){
                count+=nums[i-1]-nums[i]+1;
                nums[i-1]=nums[i]-1;
            }
            if(i+1<nums.size()&&nums[i]<=nums[i+1]){
                count+=nums[i+1]-nums[i]+1;
                nums[i+1]=nums[i]-1;
            }
        }
        return count;
    }
};