refactor 296

fishercoder1534 · fishercoder1534 · commit 09c720088944 · 2021-09-08T08:05:43.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_296.java b/src/main/java/com/fishercoder/solutions/_296.java
@@ -6,37 +6,35 @@
 
 public class _296 {
     public static class Solution1 {
+        /**
+         * Credit: https://leetcode.com/problems/best-meeting-point/solution/ Approach 3
+         */
         public int minTotalDistance(int[][] grid) {
             int m = grid.length;
             int n = grid[0].length;
-
-            List<Integer> I = new ArrayList(m);
-            List<Integer> J = new ArrayList(n);
-
+            List<Integer> rows = new ArrayList<>();
+            List<Integer> cols = new ArrayList<>();
             for (int i = 0; i < m; i++) {
                 for (int j = 0; j < n; j++) {
                     if (grid[i][j] == 1) {
-                        I.add(i);
-                        J.add(j);
+                        rows.add(i);
+                        cols.add(j);
                     }
                 }
             }
-
-            return getMin(I) + getMin(J);
+            int rowMedian = rows.get(rows.size() / 2);
+            Collections.sort(cols);
+            int colMedian = cols.get(cols.size() / 2);
+            return minDistance1D(rows, rowMedian) + minDistance1D(cols, colMedian);
         }
 
-        private int getMin(List<Integer> list) {
-            int ret = 0;
-
-            Collections.sort(list);
-
-            int i = 0;
-            int j = list.size() - 1;
-            while (i < j) {
-                ret += list.get(j--) - list.get(i++);
+        private int minDistance1D(List<Integer> points, int median) {
+            int distance = 0;
+            for (int i : points) {
+                distance += Math.abs(i - median);
             }
-
-            return ret;
+            return distance;
         }
+
     }
 }
