class Wou {
public static int main(String args[]) {
    String s = "";
    for(String x: args)
        s+=x;
    int h = 0, p = -1;    //p is for storing distance and h is for maximum distance between two strings in String 's'.
    String word = "";
    int len = args.length;
    for(int i=0;i<len;i++) {
        int cc = s.lastIndexOf(args[i])-s.indexOf(args[i]);
        if (cc>h){
            h = cc;
            for(int j=len-1;j>=0;j--)
                if(args[i]==args[j]) {
                    p = j-i;
                    break;
                }
            word = args[i];
        }
        s.replaceAll(args[i],"");
    }
    System.out.println("Most searched term is "+word);
    return p;
}
}

这是我试过的代码-

String[] a ={"C++", "Java", "C#", "C#", "Java", "Python", "C#", "Java"};
    String val ="";

     int maxDist = 0;
       for(int i=0; i<a.length; i++)
       {
          int firstOcc = -1;
          int lastOcc = -1;

          for(int j=0; j<a.length; j++)
          {
             if(a[i] == a[j])
             {
                 //val=a[j];
                 if(firstOcc == -1)
                   firstOcc = lastOcc = j;
                 //val=a[j];
             }
                else
                {
                   lastOcc = j;
                 val=a[j];
             }
          }
          if(lastOcc - firstOcc > maxDist)
             maxDist = lastOcc - firstOcc;

       }
       System.out.println("Most searched term is " + val);
}