Finished all 3 Shortest Word Distance questions

varunu28 · varunu28 · commit 065574c50366 · 2018-10-03T21:45:10.000-07:00
diff --git a/Easy/Shortest Word Distance II.java b/Easy/Shortest Word Distance II.java
@@ -0,0 +1,47 @@
+class WordDistance {
+
+    Map<String, List<Integer>> map;
+    public WordDistance(String[] words) {
+        map = new HashMap<>();
+
+        for (int i=0; i<words.length; i++) {
+            if (map.containsKey(words[i])) {
+                map.get(words[i]).add(i);
+            }
+            else {
+                List<Integer> indexes = new ArrayList<>();
+                indexes.add(i);
+
+                map.put(words[i], indexes);
+            }
+        }
+    }
+
+    public int shortest(String word1, String word2) {
+        List<Integer> index1 = map.get(word1);
+        List<Integer> index2 = map.get(word2);
+
+        int i = 0;
+        int j = 0;
+        int diff = Integer.MAX_VALUE;
+
+        while (i < index1.size() && j < index2.size()) {
+            diff = Math.min(diff, Math.abs(index1.get(i) - index2.get(j)));
+
+            if (index1.get(i) > index2.get(j)) {
+                j++;
+            }
+            else {
+                i++;
+            }
+        }
+
+        return diff;
+    }
+}
+
+/**
+ * Your WordDistance object will be instantiated and called as such:
+ * WordDistance obj = new WordDistance(words);
+ * int param_1 = obj.shortest(word1,word2);
+ */
diff --git a/Easy/Shortest Word Distance III.java b/Easy/Shortest Word Distance III.java
@@ -0,0 +1,43 @@
+class Solution {
+    public int shortestWordDistance(String[] words, String word1, String word2) {
+        int dist1 = -1;
+        int dist2 = -1;
+        int minDist = Integer.MAX_VALUE;
+        
+        boolean sameWord = word1.equals(word2);
+        
+        for (int i=0; i<words.length; i++) {
+            if (words[i].equals(word1)) {
+                if (sameWord) {
+                    if (dist1 == -1) {
+                        dist1 = i;
+                    }
+                }
+                else {
+                    dist1 = i;
+                }
+            }
+            
+            if (words[i].equals(word2)) { 
+                if (sameWord) {
+                    if (i != dist1) {
+                        dist2 = i;
+                    }
+                }
+                else {
+                    dist2 = i;
+                }
+            }
+            
+            if (dist1 != -1 && dist2 != -1) {
+                minDist = Math.min(minDist, Math.abs(dist1 - dist2));
+                if (sameWord) {
+                    dist1 = dist2;
+                    dist2 = -1;
+                }
+            }
+        }
+        
+        return minDist;
+    }
+}
diff --git a/Easy/Shortest Word Distance.java b/Easy/Shortest Word Distance.java
@@ -0,0 +1,23 @@
+class Solution {
+    public int shortestDistance(String[] words, String word1, String word2) {
+        int dist1 = -1;
+        int dist2 = -1;
+        int minDist = Integer.MAX_VALUE;
+        
+        for (int i=0; i<words.length; i++) {
+            if (words[i].equals(word1)) {
+                dist1 = i;
+            }
+            
+            if (words[i].equals(word2)) {
+                dist2 = i;
+            }
+            
+            if (dist1 != -1 && dist2 != -1) {
+                minDist = Math.min(minDist, Math.abs(dist1 - dist2));
+            }
+        }
+        
+        return minDist;
+    }
+}
