全排列等（All permutations, etc）.docVIP

全排列等（All permutations, etc） The first part, the whole permutation problem 53. string arrangement. Title: enter a string, print out the string in the characters of all permutations. For example, the input string ABC, then outputs all strings that can be arranged by characters a, B, and C ABC, ACB, BAC, BCA, cab, and cba. Analysis: this problem was originally arranged in last years Microsoft interview 100 questions, fifty-third questions, second times in Microsoft, Google and other companies very good interview questions and answers [61-70 questions] sixty-seventh questions. Coincidentally, this problem appears again this year in the 2011.10.09 Baidu written test questions. OK, next, lets take a good look at the problem. Recursive implementation Each element is selected sequentially from the set as the first element of the permutation, followed by a complete arrangement of the remaining elements, thus recursively processed so that all elements are arranged in full order. Take the string ABC as an example, and we can do so: Fixed a, seek the arrangement of the following BC, after seeking good, a and B exchange, get bac Fixed B, for the following AC arrangement, after the good, C in the first position, get CBA Fixed C, ask for the arrangement of the following ba. The code can be written as follows: Template typename T Void CalcAllPermutation_R (T, perm[], int, first, int, Num) { If (Num = 1) { Return; } For (int i = first; I first + num; ++i) { Swap (perm[i], perm[first]); CalcAllPermutation_R (perm, first + 1, num - 1); Swap (perm[i], perm[first]); } } Or so written: view plaincopy, to, clipboardprint, void, Permutation (char*, pStr, char*, pBegin); Void Permutation (char* pStr) { Permutation (pStr, pStr); } Void Permutation (char*, pStr, char*, pBegin) { If (pStr pBegin ||!!) Return; If (*pBegin =\0) { Printf (%s\n, pStr); } Else { For (char* pCh = pBegin; *pCh =\0; pCh + +!) { PCh and pBegin / / swap Char temp = *pCh; *pCh = *pBegin; *pBegin = temp; Permutation (pS