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 calledrepeatedly 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.

思路：因为会每次调用shortest，所以不可能每次现场计算，只能事前计算好了，那么就用hashmap先把所有的index存起来，然后调用的时候，然后取出来计算。

计算的时候，可以快点，只用O(n)的方法计算，因为hashmap存的时候，是按照顺序存的，所以两个list每次把最小的那个去掉，然后进行update。

class WordDistance {
    private HashMap<String, List<Integer>> hashmap;
    public WordDistance(String[] wordsDict) {
        this.hashmap = new HashMap<>();
        for(int i = 0; i < wordsDict.length; i++) {
            String word = wordsDict[i];
            hashmap.putIfAbsent(word, new ArrayList<Integer>());
            hashmap.get(word).add(i);
        }
    }
    
    public int shortest(String word1, String word2) {
        List<Integer> list1 = hashmap.get(word1);
        List<Integer> list2 = hashmap.get(word2);
        int res = Integer.MAX_VALUE;
        if(list1 != null && list2 != null) {
            int i = 0; int j = 0;
            while(i < list1.size() && j < list2.size()) {
                res = Math.min(res, Math.abs(list1.get(i) - list2.get(j)));
                if(list1.get(i) < list2.get(j)) {
                    i++;
                } else {
                    j++;
                }
            }
        }
        return res;
    }
}

/**
 * Your WordDistance object will be instantiated and called as such:
 * WordDistance obj = new WordDistance(wordsDict);
 * int param_1 = obj.shortest(word1,word2);
 */