fd

Author: dingjikerbo

solution/src/main/java/com/inuker/solution/NumberOfIslandsII.java

@@ -22,16 +22,10 @@ public List<Integer> numIslands2(int m, int n, int[][] positions) {
         List<Integer> list = new LinkedList<Integer>();
 
         mRoots = new int[m * n];
-        /**
-         * 首先都指向-1，稍后添加岛时再初始化
-         */
         Arrays.fill(mRoots, -1);
 
         for (int[] p : positions) {
             int x = p[0], y = p[1], z = x * n + y;
-            /**
-             * 指向自己
-             */
             mRoots[z] = z;
 
             mCount++;
@@ -42,9 +36,6 @@ public List<Integer> numIslands2(int m, int n, int[][] positions) {
                 if (x0 < 0 || x0 >= m || y0 < 0 || y0 >= n || mRoots[z0] == -1) {
                     continue;
                 }
-                /**
-                 * 这里是给z合并到z0中去，即新添加的这个岛要合到老的岛上去
-                 */
                 union(z, z0);
             }
 

solution/src/main/java/com/inuker/solution/ShortestWordDistance.java

@@ -11,33 +11,19 @@ public class ShortestWordDistance {
 
     // 耗时3ms
     public int shortestDistance(String[] words, String word1, String word2) {
-        List<Integer> indexs1 = new LinkedList<Integer>();
-        List<Integer> indexs2 = new LinkedList<Integer>();
+        int l1 = -1, l2 = -1, shortest = Integer.MAX_VALUE;
         for (int i = 0; i < words.length; i++) {
             if (words[i].equals(word1)) {
-                indexs1.add(i);
+                l1 = i;
             } else if (words[i].equals(word2)) {
-                indexs2.add(i);
-            }
-        }
-
-        int size1 = indexs1.size(), size2 = indexs2.size();
-        int min = Math.abs(indexs1.get(size1 - 1) - indexs2.get(size2 - 1));
-        for (int i = 0, j = 0; i < size1 && j < size2; ) {
-            int index1 = indexs1.get(i);
-            int index2 = indexs2.get(j);
-
-            min = Math.min(min, Math.abs(index1 - index2));
-
-            if (index1 < index2) {
-                i++;
-            } else if (index1 > index2) {
-                j++;
+                l2 = i;
             } else {
-                return 0;
+                continue;
+            }
+            if (l1 >= 0 && l2 >= 0) {
+                shortest = Math.min(shortest, Math.abs(l1 - l2));
             }
         }
-
-        return min;
+        return shortest;
     }
 }

solution/src/main/java/com/inuker/solution/ShortestWordDistanceII.java

@@ -2,6 +2,7 @@
 
 import java.util.ArrayList;
 import java.util.HashMap;
+import java.util.LinkedList;
 import java.util.List;
 import java.util.Map;
 
@@ -16,14 +17,8 @@ public class ShortestWordDistanceII {
     public ShortestWordDistanceII(String[] words) {
         map = new HashMap<String, List<Integer>>();
         for (int i = 0; i < words.length; i++) {
-            String w = words[i];
-            if (map.containsKey(w)) {
-                map.get(w).add(i);
-            } else {
-                List<Integer> list = new ArrayList<Integer>();
-                list.add(i);
-                map.put(w, list);
-            }
+            List<Integer> list = map.computeIfAbsent(words[i], k -> new LinkedList<>());
+            list.add(i);
         }
     }
 

test/src/main/java/com/inuker/test/Test2.java

@@ -20,38 +20,14 @@
 
 public class Test2 {
 
-    public void solve(char[][] board) {
-        if (board.length == 0) {
-            return;
-        }
-        int row = board.length, col = board[0].length;
-        for (int i = 0; i < row; i++) {
-            dfs(board, i, 0);
-            dfs(board, i, board[0].length - 1);
-        }
-        for (int i = 0; i < col; i++) {
-            dfs(board, 0, i);
-            dfs(board, row - 1, i);
-        }
-        for (int i = 0; i < row; i++) {
-            for (int j = 0; j < col; j++) {
-                if (board[i][j] == 'O') {
-                    board[i][j] = 'X';
-                } else if (board[i][j] == '#') {
-                    board[i][j] = 'O';
-                }
-            }
+    class WordDistance {
+
+        public WordDistance(String[] words) {
+            HashMap<String, List<>>
         }
-    }
 
-    void dfs(char[][] board, int i, int j) {
-        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != 'O') {
-            return;
+        public int shortest(String word1, String word2) {
+
         }
-        board[i][j] = '#';
-        dfs(board, i + 1, j);
-        dfs(board, i - 1, j);
-        dfs(board, i, j + 1);
-        dfs(board, i, j - 1);
     }
 }