mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 08:50:15 +08:00
update 0056.合并区间: 替换 go 代码和markdown语法错误
This commit is contained in:
@ -207,24 +207,26 @@ class Solution:
|
|||||||
```
|
```
|
||||||
|
|
||||||
### Go
|
### Go
|
||||||
```golang
|
```go
|
||||||
func merge(intervals [][]int) [][]int {
|
func merge(intervals [][]int) [][]int {
|
||||||
//先从小到大排序
|
sort.Slice(intervals, func(i, j int) bool {
|
||||||
sort.Slice(intervals,func(i,j int)bool{
|
return intervals[i][0] < intervals[j][0]
|
||||||
return intervals[i][0]<intervals[j][0]
|
|
||||||
})
|
})
|
||||||
//再弄重复的
|
res := make([][]int, 0, len(intervals))
|
||||||
for i:=0;i<len(intervals)-1;i++{
|
left, right := intervals[0][0], intervals[0][1]
|
||||||
if intervals[i][1]>=intervals[i+1][0]{
|
for i := 1; i < len(intervals); i++ {
|
||||||
intervals[i][1]=max(intervals[i][1],intervals[i+1][1])//赋值最大值
|
if right < intervals[i][0] {
|
||||||
intervals=append(intervals[:i+1],intervals[i+2:]...)
|
res = append(res, []int{left, right})
|
||||||
i--
|
left, right = intervals[i][0], intervals[i][1]
|
||||||
|
} else {
|
||||||
|
right = max(right, intervals[i][1])
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return intervals
|
res = append(res, []int{left, right}) // 将最后一个区间放入
|
||||||
|
return res
|
||||||
}
|
}
|
||||||
func max(a,b int)int{
|
func max(a, b int) int {
|
||||||
if a>b{
|
if a > b {
|
||||||
return a
|
return a
|
||||||
}
|
}
|
||||||
return b
|
return b
|
||||||
|
Reference in New Issue
Block a user