Commit e191dd9

authored

feat: add typescript solution to lc problem: No.0056.Merge Intervals (doocs#572)

1 parent a994d50 commit e191dd9Copy full SHA for e191dd9

File tree

+58

-0

lines changed

+58

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -113,6 +113,27 @@ class Solution {`
`113`	`113`	`}`
`114`	`114`	```
`115`	`115`
	`116`	`+### TypeScript`
	`117`	`+`
	`118`	+```ts
	`119`	`+function merge(intervals: number[][]): number[][] {`
	`120`	`+ intervals.sort((a, b) => a[0] - b[0]);`
	`121`	`+ let ans: number[][] = [];`
	`122`	`+ let index: number = -1;`
	`123`	`+ for (let interval of intervals) {`
	`124`	`+ if (index == -1 \|\| ans[index][1] < interval[0]) {`
	`125`	`+ // 保留`
	`126`	`+ ans.push(interval);`
	`127`	`+ index++;`
	`128`	`+ } else {`
	`129`	`+ // 求交集`
	`130`	`+ ans[index][1] = Math.max(ans[index][1], interval[1]);`
	`131`	`+ }`
	`132`	`+ }`
	`133`	`+ return ans;`
	`134`	`+};`
	`135`	+```
	`136`	`+`
`116`	`137`	`### C++`
`117`	`138`
`118`	`139`	```cpp

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -84,6 +84,27 @@ class Solution {`
`84`	`84`	`}`
`85`	`85`	```
`86`	`86`
	`87`	`+### TypeScript`
	`88`	`+`
	`89`	+```ts
	`90`	`+function merge(intervals: number[][]): number[][] {`
	`91`	`+ intervals.sort((a, b) => a[0] - b[0]);`
	`92`	`+ let ans: number[][] = [];`
	`93`	`+ let index: number = -1;`
	`94`	`+ for (let interval of intervals) {`
	`95`	`+ if (index == -1 \|\| ans[index][1] < interval[0]) {`
	`96`	`+ // 保留`
	`97`	`+ ans.push(interval);`
	`98`	`+ index++;`
	`99`	`+ } else {`
	`100`	`+ // 求交集`
	`101`	`+ ans[index][1] = Math.max(ans[index][1], interval[1]);`
	`102`	`+ }`
	`103`	`+ }`
	`104`	`+ return ans;`
	`105`	`+};`
	`106`	+```
	`107`	`+`
`87`	`108`	`### C++`
`88`	`109`
`89`	`110`	```cpp

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+function merge(intervals: number[][]): number[][] {`
	`2`	`+ intervals.sort((a, b) => a[0] - b[0]);`
	`3`	`+ let ans: number[][] = [];`
	`4`	`+ let index: number = -1;`
	`5`	`+ for (let interval of intervals) {`
	`6`	`+ if (index == -1 \|\| ans[index][1] < interval[0]) {`
	`7`	`+ // 保留`
	`8`	`+ ans.push(interval);`
	`9`	`+ index++;`
	`10`	`+ } else {`
	`11`	`+ // 求交集`
	`12`	`+ ans[index][1] = Math.max(ans[index][1], interval[1]);`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+ return ans;`
	`16`	`+};`

Comments

(0)