reconstruct-original-digits-from-english

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</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 guaranteed to be valid.</li>
</ul>

originalDigits

Reconstruct Original Digits from English

Hash Table

Math

String

给你一个字符串 <code>s</code> ，其中包含字母顺序打乱的用英文单词表示的若干数字（<code>0-9</code>）。按 升序 返回原始的数字。

&nbsp;

示例 1：

<pre>
输入：s = "owoztneoer"
输出："012"
</pre>

示例 2：

<pre>
输入：s = "fviefuro"
输出："45"
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s[i]</code> 为 <code>["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"]</code> 这些字符之一</li>
	<li><code>s</code> 保证是一个符合题目要求的字符串</li>
</ul>