[编程题]数组中两个字符串的最小距离

 

 

import java.util.*;
public class Main {
     public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
       while(in.hasNext()){
        int n =in.nextInt();
        String n1 =in.next();
        String n2=in.next();
        String s;
        int result =-1;int prev1 = -1;int prev2 =-1;
        for(int i=0;i<n;i++){
            s=in.next();
            if(s.equals(n1)){
                prev1 = i;
                if(prev2!=-1){
                    result = result==-1 ? prev1-prev2 : Math.min(prev1-prev2,result);
                }
            }
            if(s.equals(n2)){
                prev2 = i;
                if(prev1!=-1){
                    result = result==-1 ? prev2-prev1 : Math.min(prev2-prev1,result);
                }
            }
        }
           System.out.print(result);
       }
    
     }
}