Mid/SeniorArrayGreedy

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, i.e. A[0] > A[1] < A[2] > A[3] < A[4] > ...
  • Or, every odd-indexed element is greater than adjacent elements, i.e. 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
Inputnums = [1,2,3]
Output2
We can decrease 2 to 0 or 3 to 1.
Example 2
Inputnums = [9,6,1,6,2]
Output4
The minimum number of decreases needed to make the array zigzag is 4.

Constraints

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

Asked at 1 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate