<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>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> logs = [&quot;dig1 8 1 5 1&quot;,&quot;let1 art can&quot;,&quot;dig2 3 6&quot;,&quot;let2 own kit dig&quot;,&quot;let3 art zero&quot;]
<strong>Output:</strong> [&quot;let1 art can&quot;,&quot;let3 art zero&quot;,&quot;let2 own kit dig&quot;,&quot;dig1 8 1 5 1&quot;,&quot;dig2 3 6&quot;]
<strong>Explanation:</strong>
The letter-log contents are all different, so their ordering is &quot;art can&quot;, &quot;art zero&quot;, &quot;own kit dig&quot;.
The digit-logs have a relative order of &quot;dig1 8 1 5 1&quot;, &quot;dig2 3 6&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> logs = [&quot;a1 9 2 3 1&quot;,&quot;g1 act car&quot;,&quot;zo4 4 7&quot;,&quot;ab1 off key dog&quot;,&quot;a8 act zoo&quot;]
<strong>Output:</strong> [&quot;g1 act car&quot;,&quot;a8 act zoo&quot;,&quot;ab1 off key dog&quot;,&quot;a1 9 2 3 1&quot;,&quot;zo4 4 7&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= logs.length &lt;= 100</code></li>
	<li><code>3 &lt;= logs[i].length &lt;= 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>

void helper(const string& str, string& start, string& end) {
    for (int i = 0; i < str.size(); i++) {
        if (str[i] == ' ') {
            end = str.substr(i + 1);
            break;
        }
        else {
            start += str[i];
        }
    }
}

bool sorter(const pair<string, int>& lhs, const pair<string, int>& rhs) {
    string lhsStart;
    string lhsEnd;
    
    helper(lhs.first, lhsStart, lhsEnd);
    
    bool lhsDigit = isdigit(lhsEnd[0]);
    
    string rhsStart;
    string rhsEnd;
    
    helper(rhs.first, rhsStart, rhsEnd);
    
    bool rhsDigit = isdigit(rhsEnd[0]);
    if (lhsDigit && !rhsDigit) {
        return false;
    }
    if (rhsDigit && !lhsDigit) {
        return true;
    }
    
    if (lhsDigit && rhsDigit) {
        return lhs.second < rhs.second;
    }
    
    if (lhsEnd == rhsEnd) {
        return lhsStart < rhsStart;
    }
    return lhsEnd < rhsEnd;
}

class Solution {
public:
    vector<string> reorderLogFiles(vector<string>& logs) {
        vector<pair<string, int>> cpy;
        cpy.resize(logs.size());
        for (int i = 0; i < logs.size(); i++) {
            cpy[i] = {logs[i], i};
        }
        
        sort(cpy.begin(), cpy.end(), sorter);
        
        vector<string> answer;
        answer.resize(logs.size());
        
        for (int i = 0; i < cpy.size(); i++) {
            answer[i] = cpy[i].first;
        }
        
        return answer;
    }
};
19392