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

Merge branch 'youngyangyang04:master' into master

Browse Source
This commit is contained in:
XuBoLun
2021-08-24 09:21:50 +08:00
committed by GitHub
parent 0a8191b5c3 37384a82d9
commit bce9f7ff6e
2 changed files with 8 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -186,27 +186,27 @@ Java：
class Solution {
public int eraseOverlapIntervals(int[][] intervals) {
if (intervals.length < 2) return 0;
Arrays.sort(intervals, new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
if (o1[0] != o2[0]) {
if (o1[1] != o2[1]) {
return Integer.compare(o1[1],o2[1]);
} else {
return Integer.compare(o2[0],o1[0]);
return Integer.compare(o1[0],o2[0]);
}
}
});
int count = 0;
int count = 1;
int edge = intervals[0][1];
for (int i = 1; i < intervals.length; i++) {
if (intervals[i][0] < edge) {
count++;
} else {
if (edge <= intervals[i][0]){
count ++; //non overlap + 1
edge = intervals[i][1];
}
}
return count;
return intervals.length - count;
}
}
```

1
problems/0494.目标和.md
View File

@ -248,6 +248,7 @@ class Solution {
for (int i = 0; i < nums.length; i++) sum += nums[i];
if ((target + sum) % 2 != 0) return 0;
int size = (target + sum) / 2;
if(size < 0) size = -size;
int[] dp = new int[size + 1];
dp[0] = 1;
for (int i = 0; i < nums.length; i++) {