mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
34 lines
1.6 KiB
HTML
34 lines
1.6 KiB
HTML
<p>You are given two strings order and s. All the words of <code>order</code> are <strong>unique</strong> and were sorted in some custom order previously.</p>
|
|
|
|
<p>Permute the characters of <code>s</code> so that they match the order that <code>order</code> was sorted. More specifically, if a character <code>x</code> occurs before a character <code>y</code> in <code>order</code>, then <code>x</code> should occur before <code>y</code> in the permuted string.</p>
|
|
|
|
<p>Return <em>any permutation of </em><code>s</code><em> that satisfies this property</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> order = "cba", s = "abcd"
|
|
<strong>Output:</strong> "cbad"
|
|
<strong>Explanation:</strong>
|
|
"a", "b", "c" appear in order, so the order of "a", "b", "c" should be "c", "b", and "a".
|
|
Since "d" does not appear in order, it can be at any position in the returned string. "dcba", "cdba", "cbda" are also valid outputs.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> order = "cbafg", s = "abcd"
|
|
<strong>Output:</strong> "cbad"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= order.length <= 26</code></li>
|
|
<li><code>1 <= s.length <= 200</code></li>
|
|
<li><code>order</code> and <code>s</code> consist of lowercase English letters.</li>
|
|
<li>All the characters of <code>order</code> are <strong>unique</strong>.</li>
|
|
</ul>
|