huangge1199/leet-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

1144:递减元素使数组呈锯齿状

Browse Source
This commit is contained in:
轩辕龙儿 2023-02-27 17:03:13 +08:00
parent fe1d8a97c4
commit a56691de26
1 changed files with 6 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
src/main/java/leetcode/editor/cn/DecreaseElementsToMakeArrayZigzag.java
View File

@ -48,30 +48,13 @@ class DecreaseElementsToMakeArrayZigzag {
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public int movesToMakeZigzag(int[] nums) {
int count1 = 0;
int count2 = 0;
int[] arr = new int[nums.length];
System.arraycopy(nums, 0, arr, 0, nums.length);
for (int i = 1; i < nums.length; i++) {
if (i % 2 == 0) {
if (arr[i] <= arr[i - 1]) {
count1 += arr[i - 1] - arr[i] + 1;
int[] s = new int[2];
for (int i = 0, n = nums.length; i < n; ++i) {
int left = i > 0 ? nums[i - 1] : Integer.MAX_VALUE;
int right = i < n - 1 ? nums[i + 1] : Integer.MAX_VALUE;
s[i % 2] += Math.max(nums[i] - Math.min(left, right) + 1, 0);
}
if (nums[i] >= nums[i - 1]) {
count2 += nums[i] - nums[i - 1] + 1;
}
} else {
if (nums[i] <= nums[i - 1]) {
count2 += nums[i - 1] - nums[i] + 1;
nums[i] = nums[i - 1] - 1;
}
if (arr[i] >= arr[i - 1]) {
count1 += arr[i] - arr[i - 1] + 1;
arr[i] = arr[i - 1] - 1;
}
}
}
return Math.min(count1, count2);
return Math.min(s[0], s[1]);
}
}
//leetcode submit region end(Prohibit modification and deletion)