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: logs = ["dig1 8 1 5 1","let1 art can","dig2 3 6","let2 own kit dig","let3 art zero"]
Output: ["let1 art can","let3 art zero","let2 own kit dig","dig1 8 1 5 1","dig2 3 6"]
Constraints:
0 <= logs.length <= 100
3 <= logs[i].length <= 100
logs[i] is guaranteed to have an identifier, and a word after the identifier.
Solution:
class Solution { public String[] reorderLogFiles(String[] logs) { List<String> dLogs = new ArrayList<>(); PriorityQueue<String> lLogs = new PriorityQueue<String>((a, b) -> { String[] aArr = a.split(" "); String[] bArr = b.split(" "); String aLog = String.join(" ", Arrays.copyOfRange(aArr, 1, aArr.length)); String bLog = String.join(" ", Arrays.copyOfRange(bArr, 1, bArr.length)); if (aLog.compareTo(bLog) == 0) { return aArr[0].compareTo(bArr[0]); } return aLog.compareTo(bLog); }); for (String log : logs) { String w = log.split(" ")[1]; boolean isDigit = true; for (char c : w.toCharArray()) { if (!Character.isDigit(c)) { isDigit = false; } } if (isDigit) { dLogs.add(log); } else { lLogs.offer(log); } } String[] result = new String[logs.length]; int i = 0; while (!lLogs.isEmpty()) { result[i ++] = lLogs.poll(); } for (String dLog : dLogs) { result[i ++] = dLog; } return result; } }