Categorygithub.com/SmartsYoung/LeetCode-in-GoAlgorithms0423.reconstruct-original-digits-from-english
# README
423. 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"
解题思路
见程序注释