Sunday, October 2, 2022

Reorder Log Files

 This article is for self education


You are given an array of logs. Each log is a space-delimited string of words, where the first word is the identifier.

There are two types of logs:

  • Letter-logs: All words (except the identifier) consist of lowercase English letters.
  • Digit-logs: All words (except the identifier) consist of digits.

Reorder these logs so that:

  1. The letter-logs come before all digit-logs.
  2. The letter-logs are sorted lexicographically by their contents. If their contents are the same, then sort them lexicographically by their identifiers.
  3. The digit-logs maintain their relative ordering.

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"]
Explanation:
The letter-log contents are all different, so their ordering is "art can", "art zero", "own kit dig".
The digit-logs have a relative order of "dig1 8 1 5 1", "dig2 3 6".

Example 2:

Input: logs = ["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"]

 

Constraints:

  • 1 <= logs.length <= 100
  • 3 <= logs[i].length <= 100
  • All the tokens of logs[i] are separated by a single space.
  • logs[i] is guaranteed to have an identifier and at least one word after the identifier.



package practice;


import java.util.Arrays;
import java.util.Comparator;

public class ReorderLogFiles {
public String[] reorderLogFiles(String[] logs) {

Comparator<String> comp = new Comparator<String>() {
@Override
public int compare(String log1, String log2) {

String[] arr1 = log1.split(" ", 2);
String[] arr2 = log2.split(" ", 2);

boolean isDigit1 = Character.isDigit(arr1[1].charAt(0));
;
boolean isDigit2 = Character.isDigit(arr2[1].charAt(0));

// both are cahracter logs
if (!isDigit1 && !isDigit2) {
int val = arr1[1].compareTo(arr2[1]);
if (val != 0) {
return val;
}
return arr1[0].compareTo(arr2[0]);
}

// if first is digit and second one character

if (isDigit1 && !isDigit2) {
return 1;
}

if (!isDigit1 && isDigit2) {
return -1;
} else
return 0;

}

};

Arrays.sort(logs, comp);


return logs;
}

public static void main(String[] args) {

String[] logs = {"dig1 8 1 5 1", "let1 art can", "dig2 3 6", "let2 own kit dig", "let3 art zero"};

ReorderLogFiles rlf = new ReorderLogFiles();
System.out.println(rlf.reorderLogFiles(logs));
}
}

No comments:

Post a Comment