题目地址:
https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/
给定一个长 n n n的数组 A A A,要求将其变为或者 A [ 0 ] > A [ 1 ] < A [ 2 ] > . . . A[0]>A[1]<A[2]>... A[0]>A[1]<A[2]>...,或者 A [ 0 ] < A [ 1 ] > A [ 2 ] < A [ 3 ] > . . . A[0]<A[1]>A[2]<A[3]>... A[0]<A[1]>A[2]<A[3]>...。每一步允许将任意一个数减少 1 1 1。问最少进行多少步可以达到目的。
可以枚举如果让 A [ 0 , 2 , 4 , . . . ] A[0,2,4,...] A[0,2,4,...]减少 1 1 1达到目的总共需要多少步,再枚举如果让 A [ 1 , 3 , 5 , . . . ] A[1,3,5,...] A[1,3,5,...]减少 1 1 1达到目的总共需要多少步,然后取步数少的。关于算法的正确性,我们只需要证明,如果修改 A [ i ] A[i] A[i],那么就没必要修改 A [ i − 1 ] A[i-1] A[i−1]和 A [ i + 1 ] A[i+1] A[i+1],这还是比较显然的,因为每次修改都会使得数字变小,如果修改 A [ i ] A[i] A[i],那么再去修改 A [ i − 1 ] A[i-1] A[i−1]和 A [ i + 1 ] A[i+1] A[i+1]有可能会使得 A [ i − 1 ] > A [ i ] < A [ i + 1 ] A[i-1]>A[i]<A[i+1] A[i−1]>A[i]<A[i+1]更加难以成立,还不如不修改。所以修改的最优方案必然可以是,要么全改偶数下标,要么全改奇数下标。
代码如下:
import java.util.Arrays;
public class Solution {
public int movesToMakeZigzag(int[] nums) {
int[] A = Arrays.copyOf(nums, nums.length);
int v1 = 0, v2 = 0;
// 枚举修改偶数下标的情况
for (int i = 0; i < A.length; i += 2) {
int diff = 0;
if (i - 1 >= 0 && A[i] >= A[i - 1]) {
diff = Math.max(diff, A[i] - A[i - 1] + 1);
}
if (i + 1 < A.length && A[i] >= A[i + 1]) {
diff = Math.max(diff, A[i] - A[i + 1] + 1);
}
A[i] -= diff;
v1 += diff;
}
// 重置A,然后枚举修改奇数下标的情况
A = Arrays.copyOf(nums, nums.length);
for (int i = 1; i < A.length; i += 2) {
int diff = 0;
if (i - 1 >= 0 && A[i] >= A[i - 1]) {
diff = Math.max(diff, A[i] - A[i - 1] + 1);
}
if (i + 1 < A.length && A[i] >= A[i + 1]) {
diff = Math.max(diff, A[i] - A[i + 1] + 1);
}
A[i] -= diff;
v2 += diff;
}
return Math.min(v1, v2);
}
}
时空复杂度 O ( n ) O(n) O(n)。