-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode_1671.java
32 lines (30 loc) · 1.1 KB
/
LeetCode_1671.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
public class LeetCode_1671 {
class Solution {
public int minimumMountainRemovals(int[] nums) {
int[] dp_right = new int[nums.length];
int[] dp_left = new int[nums.length];
for (int i = 0; i < nums.length; i++) {
dp_right[i] = 1;
for (int j = 0; j < nums.length; j++) {
if(nums[i] > nums[j]) {
dp_right[i] = Math.max(dp_right[i], dp_right[j] + 1);
}
}
}
for (int i = nums.length - 1; i >= 0; i --) {
dp_left[i] = 1;
for (int j = nums.length - 1; j >= 0; j --) {
if(nums[i] > nums[j]) {
dp_left[i] = Math.max(dp_left[i], dp_left[j] + 1);
}
}
}
int ans = 0;
for (int i = 0; i < nums.length; i++) {
if(dp_right[i] > 1 && dp_left[i] > 1)
ans = Math.max(ans, dp_left[i] + dp_right[i] - 1);
}
return nums.length - ans;
}
}
}