1144. Decrease Elements To Make Array Zigzag

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

思路：分类讨论模拟一遍就好了

class Solution(object):
    def movesToMakeZigzag(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)<=1: return 0
        
        cand1 = 0
        a = list(nums)
        f = 1
        for i in range(1,len(a)):
            f = 1 - f
            if f==1:
                if a[i]>a[i-1]: continue
                cand1 += a[i-1]-(a[i]-1)
                a[i-1] = a[i]-1
            else:
                if a[i]<a[i-1]: continue
                cand1 += a[i]-(a[i-1]-1)
                a[i] = a[i-1]-1
            
        cand2 = 0
        a = list(nums)
        f = 0
        for i in range(1,len(a)):
            f = 1 - f
            if f==1:
                if a[i]>a[i-1]: continue
                cand2 += a[i-1]-(a[i]-1)
                a[i-1] = a[i]-1
            else:
                if a[i]<a[i-1]: continue
                cand2 += a[i]-(a[i-1]-1)
                a[i] = a[i-1]-1
        
#        print(cand1, cand2)
        return min(cand1, cand2)