791. Custom Sort String

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.

Note:

• S has length at most 26, and no character is repeated in S.
• T has length at most 200.
• S and T consist of lowercase letters only.

已知S字符串中字符是唯一的，没有重复，S是有序的，自定义的顺序。要求T字符串要按照S的排列顺序排列。

插入排序求解：

先获取字符串S的顺序，然后在按照S的顺序，对T进行排序，程序如下所示：

class Solution {
    public String customSortString(String S, String T) {
        int[] ch = new int[26];
        for (int i = 0; i < S.length(); ++ i){
            ch[S.charAt(i) - 'a'] = i;
        }
        char[] c = T.toCharArray();
        for (int i = 1; i < c.length; ++ i){
            char tmp = c[i];
            int j = i;
            for (j = i - 1; j >= 0; -- j){
                if (ch[c[j] - 'a'] < ch[tmp - 'a'] ){
                    break;
                }
                c[j+1] = c[j];
            }
            c[j+1] = tmp;
        }
        return new String(c);
    }
    
}