
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:
The letter-logs come before all digit-logs .
The letter-logs are sorted lexicographically by their contents. If their contents are the same, then sort them lexicographically by their identifiers.
The digit-logs maintain their relative ordering.
Return the final order of the logs .
1 <= logs.length <= 1003 <= logs[i].length <= 100All 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.