leetcode937. Reorder Log Files(重写Comparator)

You have an array of logs. Each log is a space delimited string of words.

For each log, the first word in each log is an alphanumeric identifier. Then, either:

Each word after the identifier will consist only of lowercase letters, or;
Each word after the identifier will consist only of digits.
We will call these two varieties of logs letter-logs and digit-logs. It is guaranteed that each log has at least one word after its identifier.

Reorder the logs so that all of the letter-logs come before any digit-log. The letter-logs are ordered lexicographically ignoring identifier, with the identifier used in case of ties. The digit-logs should be put in their original order.

Return the final order of the logs.

Example 1:

Input: [“a1 9 2 3 1”,“g1 act car”,“zo4 4 7”,“ab1 off key dog”,“a8 act zoo”]
Output: [“g1 act car”,“a8 act zoo”,“ab1 off key dog”,“a1 9 2 3 1”,“zo4 4 7”]

class Solution {
    public String[] reorderLogFiles(String[] logs) {
      Arrays.sort(logs,new Comparator<String>(){
         @Override 
         public int compare(String o1,String o2){
             String s1=o1.substring(o1.indexOf(' ')+1);
             String s2=o2.substring(o2.indexOf(' ')+1);
             
             char c1=s1.charAt(0);
             char c2=s2.charAt(0);
             
             if(Character.isLetter(c1)&&Character.isLetter(c2)) return s1.compareTo(s2);
             else if(Character.isLetter(c1)) return -1;
             else if(Character.isLetter(c2)) return 1;
             else return 0;
         }
      });
        return logs;
    }
}