全排列等（The whole arrangement etc.）.docVIP

全排列等（The whole arrangement etc.） The first part, the whole arrangement problem 53. The arrangement of strings. Title: enter a string to print all the permutations of the characters in that string. For example, input string ABC, which outputs all the strings that can be sorted by character a, b, and c ABC, acb, bac, bca, cab and cba. This topic was first organized in last years Microsoft interview question 53, and the second one was compiled from Microsoft, Google and other companies for excellent interview questions and solutions [61-70]. 67. This problem has appeared in baidu pen test this year. Ok, lets analyze the problem. One, recursive implementation Each element is selected from the collection, as the first element in the arrangement, and then the remaining elements are arranged in a complete array, so that the whole arrangement of all elements is obtained. To take a full permutation of string ABC, we can do this: So lets fix a, and were going to get the permutation of BC, and then, after were done, were going to swap a and b, and we get bac So Im going to fix b, and Im going to find the line in the back of ac, and Ill put it in the first place, and Ill get the cba So Im going to fix c, and Im going to find the arrangement of the following ba. The code can be written as follows: The template typename T Void CalcAllPermutation_R (T perm [], int first, int num) { If (num = 1) { The 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: view plaincopy to clipboardprint? Void Permutation (char * pStr, char * pBegin); Void Permutation (char * pStr) { The Permutation (pStr, pStr); } Void Permutation (char * pStr, char * pBegin) { If (! PStr | |! PBegin) The return; If (* pBegin = = \ 0) { Printf ( % s \ n , pStr); } The else { For (char * pCh = pBegin; * pCh! = \ 0; + + pCh) { / / swap pCh and pBegin PCh char temp = *; PCh * = * pBegin; * pBegin