937. 重新排列日志文件（ 简单自定义排序 ）

• Question
• Ideas
• • 1、Answer( Java )
  • • Code

937. 重新排列日志文件

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/reorder-data-in-log-files/
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解法思路：简单自定义排序

class Solution {
    public String[] reorderLogFiles(String[] logs) {
        String[] res = new String[logs.length];
        ArrayList listNumDig = new ArrayList<>();
        ArrayList listStrDig = new ArrayList<>();
        for (String log : logs) {
            String[] strings = log.split("\s+");
            int i = strings[1].charAt(0);
            if (i >= 48 && i <= 57) {//judge the num from [0,9] of the ASCII
                listNumDig.add(log);
            } else {
                listStrDig.add(log);
            }
        }
        listStrDig.sort(new Comparator() {
            @Override
            public int compare(String o1, String o2) {
                int index1 = o1.indexOf(" ");
                int index2 = o2.indexOf(" ");
                String temp1 = o1.substring(index1, o1.length());
                String temp2 = o2.substring(index2, o2.length());
                if (!temp1.equals(temp2)) {
                    return temp1.compareTo(temp2);
                } else {
                    return o1.substring(0, index1).compareTo(o2.substring(0, index2));
                }
            }
        });
        int index = 0;
        for (int i = 0; i < listStrDig.size(); i++) {
            res[i] = listStrDig.get(i);
            index++;
        }
        for (int i = 0; i < listNumDig.size(); i++) {
            res[index] = listNumDig.get(i);
            index++;
        }
        return res;
    }
}