• 微信公众号:美女很有趣。 工作之余,放松一下,关注即送10G+美女照片!

791. Custom Sort String

开发技术 开发技术 2周前 (04-07) 5次浏览

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.

Return any permutation of T (as a string) that satisfies this property.

Example :
Input: 
S = "cba"
T = "abcd"
Output: "cbad"
Explanation: 
"a", "b", "c" appear in S, so the order of "a", "b", "c" should be "c", "b", and "a". 
Since "d" does not appear in S, it can be at any position in T. "dcba", "cdba", "cbda" are also valid outputs. 
 1 class Solution {
 2     public String customSortString(String S, String T) {
 3         int[] count = new int[26];
 4         for (char c : T.toCharArray()) { ++count[c - 'a']; }  // count each char in T.
 5         StringBuilder sb = new StringBuilder();
 6         for (char c : S.toCharArray()) {                            
 7             while (count[c - 'a']-- > 0) { sb.append(c); }    // sort chars both in T and S by the order of S.
 8         }
 9         for (char c = 'a'; c <= 'z'; ++c) {
10             while (count[c - 'a']-- > 0) { sb.append(c); }    // group chars in T but not in S.
11         }
12         return sb.toString();
13    }
14 }

 


程序员灯塔
转载请注明原文链接:791. Custom Sort String
喜欢 (0)