2022.5.27-----leetcode. Interview 17.11

 public int findClosest(String[] words, String word1, String word2) {
         List<Integer>[] l=new ArrayList[2];// Store target word location 
         l[0]=new ArrayList<>();
         l[1]=new ArrayList<>();
        for(int i=0;i<words.length;i++){
            if(words[i].equals(word1))
                l[0].add(i);
            if(words[i].equals(word2))
                l[1].add(i);
        }
        int min=100000;
        int a=0,b=0;
        // Double pointer traversal , Move the left pointer to the right each time , Reduce distance 
        while(a<l[0].size()&&b<l[1].size()){
            if(l[0].get(a)>l[1].get(b)){
                min=Math.min(min,l[0].get(a)-l[1].get(b));
                b++;
            }else if(l[0].get(a)<l[1].get(b)){
                 min=Math.min(min,l[1].get(b)-l[0].get(a));
                a++;
            }else return 0;
        }
        return min;
    }