human
What is a the Python code you requested given the following:
I found an interesting problem on https://leetcode.com/problems/reconstruct-original-digits-from-english/:
Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.

Note:

Input contains only lowercase English letters.
Input is guaranteed to be valid and can be transformed to its original digits. That means invalid inputs such as "abc" or "zerone" are not permitted.
Input length is less than 50,000.


Example 1:

Input: "owoztneoer"

Output: "012"


Example 2:

Input: "fviefuro"

Output: "45"

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
     def originalDigits(self, s):
         """
         :type s: str
         :rtype: str
         """
         
         from collections import Counter
         dic = Counter(s)
         res = {0:'', 1:'', 2:'', 3:'', 4:'', 5:'', 6:'', 7:'', 8:'', 9:''}
         
         if dic['z'] != 0:
             res[0] = '0'*dic['z']
             s = s.replace('z', '', dic['z'])
             s = s.replace('e', '', dic['z'])
             s = s.replace('r', '', dic['z'])
             s = s.replace('o', '', dic['z'])
             dic['z'], dic['e'], dic['r'], dic['o'] = 0, dic['e']-dic['z'], dic['r']-dic['z'], dic['o']-dic['z']
             
         if dic['w'] != 0:
             res[2] = '2'*dic['w']
             s = s.replace('t', '', dic['w'])
             s = s.replace('w', '', dic['w'])
             s = s.replace('o', '', dic['w'])
             dic['t'], dic['w'], dic['o'] = dic['t']-dic['w'], 0, dic['o']-dic['w']
             
         if dic['u'] != 0:
             res[4] = '4'*dic['u']
             s = s.replace('f', '', dic['u'])
             s = s.replace('o', '', dic['u'])
             s = s.replace('u', '', dic['u'])
             s = s.replace('r', '', dic['u'])
             dic['f'], dic['o'], dic['u'], dic['r'] = dic['f']-dic['u'], dic['o']-dic['u'], 0, dic['r']-dic['u']
             
         if dic['x'] != 0:
             res[6] = '6'*dic['x']
             s = s.replace('s', '', dic['x'])
             s = s.replace('i', '', dic['x'])
             s = s.replace('x', '', dic['x'])
             dic['s'], dic['i'], dic['x'] = dic['s']-dic['x'], dic['i']-dic['x'], 0
             
         if dic['g'] != 0:
             res[8] = '8'*dic['g']
             s = s.replace('e', '', dic['g'])
             s = s.replace('i', '', dic['g'])
             s = s.replace('g', '', dic['g'])
             s = s.replace('h', '', dic['g'])
             s = s.replace('t', '', dic['g'])
             dic['e'], dic['i'], dic['g'], dic['h'], dic['t'] = dic['e']-dic['g'], dic['i']-dic['g'], 0, dic['h']-dic['g'],...