Class Solution

java.lang.Object
g0701_0800.s0791_custom_sort_string.Solution

public class Solution extends Object
791 - Custom Sort String.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> order = &ldquo;cba&rdquo;, s = &ldquo;abcd&rdquo;</p> <p><strong>Output:</strong> &ldquo;cbad&rdquo;</p> <p><strong>Explanation:</strong> &ldquo;a&rdquo;, &ldquo;b&rdquo;, &ldquo;c&rdquo; appear in order, so the order of &ldquo;a&rdquo;, &ldquo;b&rdquo;, &ldquo;c&rdquo; should be &ldquo;c&rdquo;, &ldquo;b&rdquo;, and &ldquo;a&rdquo;. Since &ldquo;d&rdquo; does not appear in order, it can be at any position in the returned string. &ldquo;dcba&rdquo;, &ldquo;cdba&rdquo;, &ldquo;cbda&rdquo; are also valid outputs.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> order = &ldquo;cbafg&rdquo;, s = &ldquo;abcd&rdquo;</p> <p><strong>Output:</strong> &ldquo;cbad&rdquo;</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>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details