<p>Given a string <code>s</code> containing an out-of-order English representation of digits <code>0-9</code>, return <em>the digits in <strong>ascending</strong> order</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "owoztneoer"
<strong>Output:</strong> "012"
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "fviefuro"
<strong>Output:</strong> "45"
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s[i]</code> is one of the characters <code>[&quot;e&quot;,&quot;g&quot;,&quot;f&quot;,&quot;i&quot;,&quot;h&quot;,&quot;o&quot;,&quot;n&quot;,&quot;s&quot;,&quot;r&quot;,&quot;u&quot;,&quot;t&quot;,&quot;w&quot;,&quot;v&quot;,&quot;x&quot;,&quot;z&quot;]</code>.</li>
	<li><code>s</code> is <strong>guaranteed</strong> to be valid.</li>
</ul>

class Solution {
public:
    string originalDigits(string s) {
        map<char,int>m;
    string ans;
    for(auto it:s) m[it]++;
     
   vector<int> digitCount(10, 0);
        
      
        digitCount[0] = m['z'];   
        digitCount[2] = m['w'];   
        digitCount[4] = m['u']; 
        digitCount[6] = m['x'];   
        digitCount[8] = m['g']; 

      
digitCount[1] = m['o'] - digitCount[0] - digitCount[2] - digitCount[4]; 
        digitCount[3] = m['h'] - digitCount[8]; 
        digitCount[5] = m['f'] - digitCount[4]; 
        digitCount[7] = m['s'] - digitCount[6]; 
        digitCount[9] = m['i'] - digitCount[5] - digitCount[6] - digitCount[8];  
        
        for (int i = 0; i < 10; ++i) {
            ans += string(digitCount[i], '0' + i);
        }
        
        return ans;
    }
};
12200