Leetcode 244 Shortest Word Distance II

This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parameters. How would you optimize it?

Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest distance between these two words in the list.

For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Given word1 = “coding”, word2 = “practice”, return 3.
Given word1 = "makes", word2 = "coding", return 1.

Note:
You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.

Solution 1: use hash map to record all the positions for each word. So each time call only need to check the word1 and word2 position list.

 public class WordDistance {  
   Map<String,List<Integer>> map;  
   public WordDistance(String[] words) {  
     map=new HashMap<>();  
     int n=words.length;  
     for (int i=0; i<n; i++) {  
       if (map.containsKey(words[i])) map.get(words[i]).add(i);  
       else {  
         List<Integer> one=new ArrayList<>();  
         one.add(i);  
         map.put(words[i],one);  
       }  
     }  
   }  
   public int shortest(String word1, String word2) {  
     int res=Integer.MAX_VALUE;  
     List<Integer> l1=map.get(word1);  
     List<Integer> l2=map.get(word2);  
     int i=0, j=0;  
     while (i<l1.size() && j<l2.size()) {  
       res=Math.min(res,Math.abs(l1.get(i)-l2.get(j)));  
       if (l1.get(i)<l2.get(j)) i++;  
       else j++;  
     }  
     return res;  
   }  
 }