題目

題解

package com.killshadow.leetcode;

public class MovesToMakeZigzag {
    public static void main(String[] args) {
        int[] nums = new int[]{9, 6, 1, 6, 2};
        int[] num = new int[]{7, 4, 8, 9, 7, 7, 5};
        int[] nums1 = new int[]{2, 7, 10, 9, 8, 9};
        System.out.println(new MovesToMakeZigzag().movesToMakeZigzag(nums1));
    }

    public int movesToMakeZigzag(int[] nums) {
        // 初始化奇偶數(shù)減小量
        int odd = 0;
        int even = 0;
        int len = nums.length;
        int left;
        int right;
        for (int i = 0; i < len; i++) {
            if (i % 2 == 0) {
                // 奇數(shù)成鋸齒狀時(shí), 看偶數(shù), 取差值+1的最大值
                left = (i > 0) && (nums[i] >= nums[i - 1]) ? (nums[i] - nums[i - 1] + 1) : 0;
                right = (i < (len - 1)) && (nums[i] >= nums[i + 1]) ? (nums[i] - nums[i + 1] + 1) : 0;
                even += Math.max(left, right);
            } else {
                // 偶數(shù)成鋸齒狀時(shí), 看奇數(shù), 取差值+1的最大值
                left = nums[i] >= nums[i - 1] ? (nums[i] - nums[i - 1] + 1) : 0;
                right = (i < (len - 1)) && (nums[i] >= nums[i + 1]) ? (nums[i] - nums[i + 1] + 1) : 0;
                odd += Math.max(left, right);
            }
        }
        return Math.min(even, odd);
    }
}