Leetcode-791 Custom Sort String(自定义字符串排序)

int Bible[30];

bool cmp(char a,char b)
{
//    printf("%d %d\n",a,b);
    return Bible[a-'a'] >= Bible[b-'a'] ? 0 : 1;//-97
}

class Solution
{
    public:
        string customSortString(string S, string T)
        {
            memset(Bible,0,sizeof(Bible));
            int layer = 1;
            for(auto c:S)
            {
                Bible[c-'a'] = layer ++;
            }
            sort(T.begin(),T.end(),cmp);
            return T;
        }
};