algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1054 from zhicheng-lee/master

Browse Source 
Update 0435.无重叠区间.md Java版本
This commit is contained in:
程序员Carl
2022-02-09 14:50:38 +08:00
committed by GitHub
parent f222a40348 4342a2f00b
commit a8f664abb6
2 changed files with 16 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
problems/0435.无重叠区间.md
View File

@ -183,28 +183,22 @@ public:
```java ```java
class Solution { class Solution {
public int eraseOverlapIntervals(int[][] intervals) { public int eraseOverlapIntervals(int[][] intervals) {
if (intervals.length < 2) return 0; Arrays.sort(intervals, (a, b) -> {
if (a[0] == a[0]) return a[1] - b[1];
Arrays.sort(intervals, new Comparator<int[]>() { return a[0] - b[0];
@Override
public int compare(int[] o1, int[] o2) {
if (o1[1] != o2[1]) {
return Integer.compare(o1[1],o2[1]);
} else {
return Integer.compare(o1[0],o2[0]);
}
}
}); });
int count = 1; int count = 0;
int edge = intervals[0][1]; int edge = Integer.MIN_VALUE;
for (int i = 1; i < intervals.length; i++) { for (int i = 0; i < intervals.length; i++) {
if (edge <= intervals[i][0]){ if (edge <= intervals[i][0]) {
count ++; //non overlap + 1
edge = intervals[i][1]; edge = intervals[i][1];
} else {
count++;
} }
} }
return intervals.length - count;
return count;
} }
} }
``` ```

12
problems/背包问题理论基础完全背包.md
View File

@ -183,11 +183,9 @@ private static void testCompletePack(){
int[] value = {15, 20, 30}; int[] value = {15, 20, 30};
int bagWeight = 4; int bagWeight = 4;
int[] dp = new int[bagWeight + 1]; int[] dp = new int[bagWeight + 1];
for (int i = 0; i < weight.length; i++){ for (int i = 0; i < weight.length; i++){ // 遍历物品
for (int j = 1; j <= bagWeight; j++){ for (int j = weight[i]; j <= bagWeight; j++){ // 遍历背包容量
if (j - weight[i] >= 0){ dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
}
} }
} }
for (int maxValue : dp){ for (int maxValue : dp){
@ -201,8 +199,8 @@ private static void testCompletePackAnotherWay(){
int[] value = {15, 20, 30}; int[] value = {15, 20, 30};
int bagWeight = 4; int bagWeight = 4;
int[] dp = new int[bagWeight + 1]; int[] dp = new int[bagWeight + 1];
for (int i = 1; i <= bagWeight; i++){ for (int i = 1; i <= bagWeight; i++){ // 遍历背包容量
for (int j = 0; j < weight.length; j++){ for (int j = 0; j < weight.length; j++){ // 遍历物品
if (i - weight[j] >= 0){ if (i - weight[j] >= 0){
dp[i] = Math.max(dp[i], dp[i - weight[j]] + value[j]); dp[i] = Math.max(dp[i], dp[i - weight[j]] + value[j]);
} }