字符串全排列

//字符串的全排列：递归实现
void Permutation(char* pStr){
    if (pStr == nullptr)
        return;
    Permutation(pStr, pStr);
}
void Permutation(char* pStr, char* pBegin){
    if (*pBegin == '')
        printf("%s", pStr);
    else{
        for (char* pCh = pBegin; pCh != ''; ++pCh){
            char temp = *pBegin;
            *pBegin = *pCh;
            *pCh = temp;
            
            Permutation(pStr, pBegin + 1);
            
            temp = *pBegin;
            *pBegin = *pCh;
            *pCh = temp;
        }
    }
}