leetcode522

class Solution {
  public int findLUSlength(String[] strs) {
    List<String> strList = new LinkedList<String>();
    for(String str:strs){
      strList.add(str);
    }
    while(strList.size()>0){
      int max = -1;
      String r = null;
      for(String s:strList){
        if (s.length()>max){
          max = s.length();
          r = s;
        }
      }
      boolean ok = true;
      char[] rs = r.toCharArray();
      strList.remove(r);
      List<String> subStringList = new ArrayList<String>();
      for(String s:strList){
        if (s.equals(r)){
          ok = false;
        }
        char[] cs = s.toCharArray();
        int clen = s.length();
        int i=0;
        int j =0;
        while(j<clen && i<max){
          while(i<max && rs[i]!=cs[j]){
            i++;
          }
          if (i<max && rs[i]==cs[j]){
            j++;
          }else{
            break;
          }
          i++;
        }
        if (j==clen){
          subStringList.add(s);
        }
      }
      for(String s:subStringList){
        strList.remove(s);
      }
      if (ok){
        return max;
      }

    }
    return -1;
  }
}