<p>Given an array <code>nums</code> of integers, a <em>move</em>&nbsp;consists of choosing any element and <strong>decreasing it by 1</strong>.</p>

<p>An array <code>A</code> is a&nbsp;<em>zigzag array</em>&nbsp;if either:</p>

<ul>
	<li>Every even-indexed element is greater than adjacent elements, ie.&nbsp;<code>A[0] &gt; A[1] &lt; A[2] &gt; A[3] &lt; A[4] &gt; ...</code></li>
	<li>OR, every odd-indexed element is greater than adjacent elements, ie.&nbsp;<code>A[0] &lt; A[1] &gt; A[2] &lt; A[3] &gt; A[4] &lt; ...</code></li>
</ul>

<p>Return the minimum number of moves to transform the given array <code>nums</code> into a zigzag array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3]
<strong>Output:</strong> 2
<strong>Explanation:</strong> We can decrease 2 to 0 or 3 to 1.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [9,6,1,6,2]
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>

class Solution {
public:
    int movesToMakeZigzag(vector<int>& nums) {
        int left_diff = -1, right_diff = -1;
        int odd_cost = 0, even_cost = 0;
        int max_diff = 0;
        if(nums.size() < 2)
            return 0;
        right_diff = nums[0] - nums[1];
        if (right_diff >= 0)
            even_cost += right_diff + 1;
        for (int i = 1; i < nums.size() - 1; i++)
        {
            left_diff = -right_diff;
            right_diff = nums[i] - nums[i + 1];
            max_diff = max(left_diff, right_diff);
            if (max_diff >= 0)
            {
                if (i % 2 == 0)
                    even_cost += max_diff + 1;
                else
                    odd_cost += max_diff + 1;
            }
        }
        left_diff = -right_diff;
        if (left_diff >= 0)
        {
            if (nums.size() % 2)
                even_cost += left_diff + 1;
            else
                odd_cost += left_diff + 1;
        }
        return min(odd_cost, even_cost);
    }
};
9100