[LeetCode] 937. Reorder Log Files My SubmissionsBack to Contest (one more time）

题：https://leetcode.com/problems/reorder-log-files/description/

题目

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"]

Note:

1. 0 <= logs.length <= 100
2. 3 <= logs[i].length <= 100
3. logs[i] is guaranteed to have an identifier, and a word after the identifier.

题目大意

对 字符串数组logs 进行排序。
字符串数组logs 每个元素为log， log 由 identifier 和 identifier 后面的 多个 小写字母串 或 数字。

排序规则：

1. 数字log 放在 字母串log 后 且 要求是稳定的。
2. 字母串的log 根据 字符大小排序。

思路

问题的关键是定义 两个 log 的大小关系。
定义 log的大小关系后通过sort函数进行排序。

class Solution {
    public String[] reorderLogFiles(String[] logs) {
        Arrays.sort(logs, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                int o1locSub  =  o1.indexOf(' ');
                int o2locSub  =  o2.indexOf(' ');
                String o1SubString = o1.substring(o1locSub+1);
                String o2SubString = o2.substring(o2locSub+1);
                if(o1SubString.charAt(0)>='0' && o1SubString.charAt(0)<='9' && o2SubString.charAt(0)>='0' && o2SubString.charAt(0)<='9')
                    return 0;
                if(o1SubString.charAt(0)>='0' && o1SubString.charAt(0)<='9' )
                    return 1;
                if(o2SubString.charAt(0)>='0' && o2SubString.charAt(0)<='9')
                    return -1;
                int i  = 0;
                while(i<o1SubString.length() && i<o2SubString.length()){
                    if(o1SubString.charAt(i) == o2SubString.charAt(i))
                        i++;
                    else
                        return  o1SubString.charAt(i) - o2SubString.charAt(i);
                }
                if(i == o1SubString.length())
                    return -1;
                else
                    return 1;
            }
        });
        return logs;
    }
}