Commit 4fbb8b9

committed

feat: add leetcode question #56

1 parent 8cf8433 commit 4fbb8b9Copy full SHA for 4fbb8b9

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+package com.hi.dhl.algorithms.leetcode._56.java;`
	`2`	`+`
	`3`	`+import java.util.Arrays;`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * <pre>`
	`7`	`+ * author: dhl`
	`8`	`+ * date : 2022年10月24日`
	`9`	`+ * desc :`
	`10`	`+ * </pre>`
	`11`	`+ */`
	`12`	`+`
	`13`	`+class Solution {`
	`14`	`+ public int[][] merge(int[][] intervals) {`
	`15`	`+ if (intervals == null) {`
	`16`	`+ return new int[0][];`
	`17`	`+ }`
	`18`	`+ int len = intervals.length;`
	`19`	`+ Arrays.sort(intervals, (x, y) -> (x[0] - y[0]));`
	`20`	`+ int[][] result = new int[len][2];`
	`21`	`+ int index = 0;`
	`22`	`+ for (int[] item : intervals) {`
	`23`	`+ if (index == 0 \|\| item[0] > result[index - 1][1]) {`
	`24`	`+ result[index++] = item;`
	`25`	`+ } else {`
	`26`	`+ result[index - 1][1] = Math.max(item[1], result[index - 1][1]);`
	`27`	`+ }`
	`28`	`+ }`
	`29`	`+ return Arrays.copyOfRange(result, 0, index);`
	`30`	`+ }`
	`31`	`+}`

Comments

(0)