[Leetcode]937. Reorder Log Files给日志文件排序

2020-12-13 02:06

阅读：525

标签：代码 space ide character 一个 dig hat bsp file

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:

0
3
logs[i] is guaranteed to have an identifier, and a word after the identifier.

题意：

给定日志文件(规定首单词是认证号)，要求以字母日志在前，数字日志在后的顺序排序

思路：

重写一个Comparator

代码：

 1 class Solution {
 2       public String[] reorderLogFiles(String[] logs) {
 3        Comparator myComp = new Comparator() {
 4          @Override
 5          public int compare(String s1, String s2) {
 6            String[] split1 = s1.split(" ", 2);
 7            String[] split2 = s2.split(" ", 2);
 8            boolean isDigit1 = Character.isDigit(split1[1].charAt(0));
 9            boolean isDigit2 = Character.isDigit(split2[1].charAt(0));
10            if(!isDigit1 && !isDigit2) {             
11              int comp = split1[1].compareTo(split2[1]);
12              if(comp != 0)
13               return comp;
14               return split1[0].compareTo(split2[0]);
15            }
16              return isDigit1 ? (isDigit2 ? 0 : 1) : -1;
17          }
18        };
19        Arrays.sort(logs, myComp);
20        return logs;
21     }
22 }

[Leetcode]937. Reorder Log Files给日志文件排序

标签：代码 space ide character 一个 dig hat bsp file

原文地址：https://www.cnblogs.com/liuliu5151/p/11026126.html

上一篇：Win 8.1 IIS8.0 404.17错误解决方案

下一篇：C# 使用摄像头拍照支持Win7 64位

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：[Leetcode]937. Reorder Log Files给日志文件排序
文章链接：http://soscw.com/essay/24897.html

亲，登录后才可以留言！

[Leetcode]937. Reorder Log Files给日志文件排序

评论

热门文章

推荐文章

最新文章

置顶文章