refactor 986

fishercoder1534 · fishercoder1534 · commit 06e8e3081a2d · 2021-11-24T15:01:03.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_986.java b/src/main/java/com/fishercoder/solutions/_986.java
@@ -5,27 +5,23 @@
 
 public class _986 {
     public static class Solution1 {
-        public int[][] intervalIntersection(int[][] A, int[][] B) {
+        public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {
             int i = 0;
             int j = 0;
             List<int[]> list = new ArrayList<>();
-            while (i < A.length && j < B.length) {
-                int start = Math.max(A[i][0], B[j][0]);
-                int end = Math.min(A[i][1], B[j][1]);
+            while (i < firstList.length && j < secondList.length) {
+                int start = Math.max(firstList[i][0], secondList[j][0]);
+                int end = Math.min(firstList[i][1], secondList[j][1]);
                 if (start <= end) {
                     list.add(new int[]{start, end});
                 }
-                if (end == A[i][1]) {
+                if (end == firstList[i][1]) {
                     i++;
                 } else {
                     j++;
                 }
             }
-            int[][] result = new int[list.size()][2];
-            for (int k = 0; k < list.size(); k++) {
-                result[k] = list.get(k);
-            }
-            return result;
+            return list.toArray(new int[list.size()][2]);
         }
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -5,27 +5,23 @@`
`5`	`5`
`6`	`6`	`public class _986 {`
`7`	`7`	`public static class Solution1 {`
`8`		`- public int[][] intervalIntersection(int[][] A, int[][] B) {`
	`8`	`+ public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {`
`9`	`9`	`int i = 0;`
`10`	`10`	`int j = 0;`
`11`	`11`	`List<int[]> list = new ArrayList<>();`
`12`		`- while (i < A.length && j < B.length) {`
`13`		`- int start = Math.max(A[i][0], B[j][0]);`
`14`		`- int end = Math.min(A[i][1], B[j][1]);`
	`12`	`+ while (i < firstList.length && j < secondList.length) {`
	`13`	`+ int start = Math.max(firstList[i][0], secondList[j][0]);`
	`14`	`+ int end = Math.min(firstList[i][1], secondList[j][1]);`
`15`	`15`	`if (start <= end) {`
`16`	`16`	`list.add(new int[]{start, end});`
`17`	`17`	`}`
`18`		`- if (end == A[i][1]) {`
	`18`	`+ if (end == firstList[i][1]) {`
`19`	`19`	`i++;`
`20`	`20`	`} else {`
`21`	`21`	`j++;`
`22`	`22`	`}`
`23`	`23`	`}`
`24`		`- int[][] result = new int[list.size()][2];`
`25`		`- for (int k = 0; k < list.size(); k++) {`
`26`		`- result[k] = list.get(k);`
`27`		`- }`
`28`		`- return result;`
	`24`	`+ return list.toArray(new int[list.size()][2]);`
`29`	`25`	`}`
`30`	`26`	`}`
`31`	`27`	`}`