refactor 986

Author: fishercoder1534

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]);
         }
     }
 }