mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
47 lines
2.1 KiB
HTML
47 lines
2.1 KiB
HTML
|
<p>You are given an array of <code>logs</code>. Each log is a space-delimited string of words, where the first word is the <strong>identifier</strong>.</p>
|
||
|
|
|
||
|
|
<p>There are two types of logs:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><b>Letter-logs</b>: All words (except the identifier) consist of lowercase English letters.</li>
|
||
|
|
<li><strong>Digit-logs</strong>: All words (except the identifier) consist of digits.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>Reorder these logs so that:</p>
|
||
|
|
|
||
|
|
<ol>
|
||
|
|
<li>The <strong>letter-logs</strong> come before all <strong>digit-logs</strong>.</li>
|
||
|
|
<li>The <strong>letter-logs</strong> are sorted lexicographically by their contents. If their contents are the same, then sort them lexicographically by their identifiers.</li>
|
||
|
|
<li>The <strong>digit-logs</strong> maintain their relative ordering.</li>
|
||
|
|
</ol>
|
||
|
|
|
||
|
|
<p>Return <em>the final order of the logs</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> logs = ["dig1 8 1 5 1","let1 art can","dig2 3 6","let2 own kit dig","let3 art zero"]
|
||
|
|
<strong>Output:</strong> ["let1 art can","let3 art zero","let2 own kit dig","dig1 8 1 5 1","dig2 3 6"]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
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".
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> logs = ["a1 9 2 3 1","g1 act car","zo4 4 7","ab1 off key dog","a8 act zoo"]
|
||
|
|
<strong>Output:</strong> ["g1 act car","a8 act zoo","ab1 off key dog","a1 9 2 3 1","zo4 4 7"]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= logs.length <= 100</code></li>
|
||
|
|
<li><code>3 <= logs[i].length <= 100</code></li>
|
||
|
|
<li>All the tokens of <code>logs[i]</code> are separated by a <strong>single</strong> space.</li>
|
||
|
|
<li><code>logs[i]</code> is guaranteed to have an identifier and at least one word after the identifier.</li>
|
||
|
|
</ul>
|