next-greater-element-iii.md

<p>Given a positive <strong>32-bit</strong> integer <strong>n</strong>, you need to find the smallest <strong>32-bit</strong> integer which has exactly the same digits existing in the integer <strong>n</strong> and is greater in value than n. If no such positive <strong>32-bit</strong> integer exists, you need to return -1.</p>

<p><strong>Example 1:</strong></p>

<pre>
<strong>Input:</strong> 12
<strong>Output:</strong> 21
</pre>

<p>&nbsp;</p>

<p><strong>Example 2:</strong></p>

<pre>
<strong>Input:</strong> 21
<strong>Output:</strong> -1
</pre>

<p>&nbsp;</p>