Skip to content

Commit 813ed3c

Browse files
yanglbmeyanglbme
committed
feat: add solutions to lc problems: No.0056,0057
1 parent c1ff28e commit 813ed3c

File tree

13 files changed

+697
-118
lines changed

13 files changed

+697
-118
lines changed

‎solution/0000-0099/0056.Merge Intervals/README.md

+156-2
Original file line numberDiff line numberDiff line change
@@ -35,27 +35,181 @@
3535
<li><code>0 <= start<sub>i</sub> <= end<sub>i</sub> <= 10<sup>4</sup></code></li>
3636
</ul>
3737

38-
3938
## 解法
4039

4140
<!-- 这里可写通用的实现逻辑 -->
4241

42+
区间合并，将所有存在交集的区间进行合并。
43+
44+
模板：
45+
46+
```py
47+
def merge(intervals):
48+
res = []
49+
intervals.sort(key=lambda x: x[0])
50+
st = ed = -1
51+
for s, e in intervals:
52+
if ed < s:
53+
if st != -1:
54+
res.append([st, ed])
55+
st, ed = e[0], e[1]
56+
else:
57+
ed = max(ed, e[1])
58+
if st != -1:
59+
res.append([st, ed])
60+
return res
61+
```
62+
4363
<!-- tabs:start -->
4464

4565
### **Python3**
4666

4767
<!-- 这里可写当前语言的特殊实现逻辑 -->
4868

4969
```python
50-
70+
class Solution:
71+
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
72+
intervals.sort(key=lambda x: x[0])
73+
st = ed = -1
74+
res = []
75+
for s, e in intervals:
76+
if ed < s:
77+
if st != -1:
78+
res.append([st, ed])
79+
st, ed = s, e
80+
else:
81+
ed = max(ed, e)
82+
if st != -1:
83+
res.append([st, ed])
84+
return res
5185
```
5286

5387
### **Java**
5488

5589
<!-- 这里可写当前语言的特殊实现逻辑 -->
5690

5791
```java
92+
class Solution {
93+
public int[][] merge(int[][] intervals) {
94+
Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
95+
int st = -1, ed = -1;
96+
List<int[]> res = new ArrayList<>();
97+
for (int[] e : intervals) {
98+
if (ed < e[0]) {
99+
if (st != -1) {
100+
res.add(new int[]{st, ed});
101+
}
102+
st = e[0];
103+
ed = e[1];
104+
} else {
105+
ed = Math.max(ed, e[1]);
106+
}
107+
}
108+
if (st != -1) {
109+
res.add(new int[]{st, ed});
110+
}
111+
return res.toArray(new int[res.size()][]);
112+
}
113+
}
114+
```
115+
116+
### **C++**
117+
118+
```cpp
119+
class Solution {
120+
public:
121+
vector<vector<int>> merge(vector<vector<int>> &intervals) {
122+
sort(intervals.begin(), intervals.end());
123+
vector<vector<int>> res;
124+
int st = -1, ed = -1;
125+
for (auto e : intervals)
126+
{
127+
if (ed < e[0])
128+
{
129+
if (st != -1)
130+
{
131+
res.push_back({st, ed});
132+
}
133+
st = e[0];
134+
ed = e[1];
135+
}
136+
else
137+
{
138+
ed = max(ed, e[1]);
139+
}
140+
}
141+
if (st != -1)
142+
{
143+
res.push_back({st, ed});
144+
}
145+
return res;
146+
}
147+
};
148+
```
149+
150+
### **Go**
151+
152+
```go
153+
func merge(intervals [][]int) [][]int {
154+
var res [][]int
155+
sort.Slice(intervals, func(i, j int) bool {
156+
return intervals[i][0] < intervals[j][0]
157+
})
158+
st, ed := -1, -1
159+
for _, e := range intervals {
160+
if ed < e[0] {
161+
if st != -1 {
162+
res = append(res, []int{st, ed})
163+
}
164+
st, ed = e[0], e[1]
165+
} else {
166+
ed = max(ed, e[1])
167+
}
168+
}
169+
if st != -1 {
170+
res = append(res, []int{st, ed})
171+
}
172+
return res
173+
}
174+
175+
func max(a, b int) int {
176+
if a > b {
177+
return a
178+
}
179+
return b
180+
}
181+
```
58182

183+
### **C#**
184+
185+
```cpp
186+
public class Solution {
187+
public int[][] Merge(int[][] intervals) {
188+
var res = new List<int[]>();
189+
int st = -1, ed = -1;
190+
foreach (var e in intervals.OrderBy(a => a[0]))
191+
{
192+
if (ed < e[0])
193+
{
194+
if (st != -1)
195+
{
196+
res.Add(new int[] { st, ed });
197+
}
198+
st = e[0];
199+
ed = e[1];
200+
}
201+
else
202+
{
203+
ed = Math.Max(ed, e[1]);
204+
}
205+
}
206+
if (st != -1)
207+
{
208+
res.Add(new int[] { st, ed });
209+
}
210+
return res.ToArray();
211+
}
212+
}
59213
```
60214
61215
### **...**

‎solution/0000-0099/0056.Merge Intervals/README_EN.md

+135-1
Original file line numberDiff line numberDiff line change
@@ -40,13 +40,147 @@
4040
### **Python3**
4141

4242
```python
43-
43+
class Solution:
44+
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
45+
intervals.sort(key=lambda x: x[0])
46+
st = ed = -1
47+
res = []
48+
for s, e in intervals:
49+
if ed < s:
50+
if st != -1:
51+
res.append([st, ed])
52+
st, ed = s, e
53+
else:
54+
ed = max(ed, e)
55+
if st != -1:
56+
res.append([st, ed])
57+
return res
4458
```
4559

4660
### **Java**
4761

4862
```java
63+
class Solution {
64+
public int[][] merge(int[][] intervals) {
65+
Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
66+
int st = -1, ed = -1;
67+
List<int[]> res = new ArrayList<>();
68+
for (int[] e : intervals) {
69+
if (ed < e[0]) {
70+
if (st != -1) {
71+
res.add(new int[]{st, ed});
72+
}
73+
st = e[0];
74+
ed = e[1];
75+
} else {
76+
ed = Math.max(ed, e[1]);
77+
}
78+
}
79+
if (st != -1) {
80+
res.add(new int[]{st, ed});
81+
}
82+
return res.toArray(new int[res.size()][]);
83+
}
84+
}
85+
```
86+
87+
### **C++**
88+
89+
```cpp
90+
class Solution {
91+
public:
92+
vector<vector<int>> merge(vector<vector<int>> &intervals) {
93+
sort(intervals.begin(), intervals.end());
94+
vector<vector<int>> res;
95+
int st = -1, ed = -1;
96+
for (auto e : intervals)
97+
{
98+
if (ed < e[0])
99+
{
100+
if (st != -1)
101+
{
102+
res.push_back({st, ed});
103+
}
104+
st = e[0];
105+
ed = e[1];
106+
}
107+
else
108+
{
109+
ed = max(ed, e[1]);
110+
}
111+
}
112+
if (st != -1)
113+
{
114+
res.push_back({st, ed});
115+
}
116+
return res;
117+
}
118+
};
119+
```
120+
121+
### **Go**
122+
123+
```go
124+
func merge(intervals [][]int) [][]int {
125+
var res [][]int
126+
sort.Slice(intervals, func(i, j int) bool {
127+
return intervals[i][0] < intervals[j][0]
128+
})
129+
st, ed := -1, -1
130+
for _, e := range intervals {
131+
if ed < e[0] {
132+
if st != -1 {
133+
res = append(res, []int{st, ed})
134+
}
135+
st, ed = e[0], e[1]
136+
} else {
137+
ed = max(ed, e[1])
138+
}
139+
}
140+
if st != -1 {
141+
res = append(res, []int{st, ed})
142+
}
143+
return res
144+
}
145+
146+
func max(a, b int) int {
147+
if a > b {
148+
return a
149+
}
150+
return b
151+
}
152+
```
49153

154+
### **C#**
155+
156+
```cpp
157+
public class Solution {
158+
public int[][] Merge(int[][] intervals) {
159+
var res = new List<int[]>();
160+
int st = -1, ed = -1;
161+
foreach (var e in intervals.OrderBy(a => a[0]))
162+
{
163+
if (ed < e[0])
164+
{
165+
if (st != -1)
166+
{
167+
res.Add(new int[] { st, ed });
168+
}
169+
st = e[0];
170+
ed = e[1];
171+
}
172+
else
173+
{
174+
ed = Math.Max(ed, e[1]);
175+
}
176+
}
177+
if (st != -1)
178+
{
179+
res.Add(new int[] { st, ed });
180+
}
181+
return res.ToArray();
182+
}
183+
}
50184
```
51185
52186
### **...**

‎solution/0000-0099/0056.Merge Intervals/Solution.cpp

+22-29
Original file line numberDiff line numberDiff line change
@@ -1,36 +1,29 @@
1-
/**
2-
* Definition for an interval.
3-
* struct Interval {
4-
* int start;
5-
* int end;
6-
* Interval() : start(0), end(0) {}
7-
* Interval(int s, int e) : start(s), end(e) {}
8-
* };
9-
*/
10-
bool cmp(Interval &val1,Interval &val2){
11-
return !(val1.start >= val2.start);
12-
}
13-
141
class Solution {
152
public:
16-
vector<Interval> merge(vector<Interval>& intervals) {
17-
18-
int len = intervals.size();
19-
if(len <= 1)return intervals;
20-
21-
sort(intervals.begin(),intervals.end(),cmp);
22-
23-
vector<Interval> ans;
24-
ans.push_back(intervals[0]);
25-
26-
for(int i = 1;i<len;i++){
27-
if(ans.back().end >= intervals[i].start){
28-
ans.back().end = max(ans.back().end,intervals[i].end);
3+
vector<vector<int>> merge(vector<vector<int>> &intervals) {
4+
sort(intervals.begin(), intervals.end());
5+
vector<vector<int>> res;
6+
int st = -1, ed = -1;
7+
for (auto e : intervals)
8+
{
9+
if (ed < e[0])
10+
{
11+
if (st != -1)
12+
{
13+
res.push_back({st, ed});
14+
}
15+
st = e[0];
16+
ed = e[1];
2917
}
30-
else{
31-
ans.push_back(intervals[i]);
18+
else
19+
{
20+
ed = max(ed, e[1]);
3221
}
3322
}
34-
return ans;
23+
if (st != -1)
24+
{
25+
res.push_back({st, ed});
26+
}
27+
return res;
3528
}
3629
};

0 commit comments

Comments
 (0)