专注于互联网--专注于架构

全排列公式:全排列

="cpp:nogutter"# algorithm# deque# iostreamusing std;deque di; N;void pr(deque vi){ for( i = 0; i vi.size; i) { coutvi[i]; } coutendl;}void perm(deque vi, n){ (N-1 n) { pr(vi); } { num = di[n+1]; deque vtmp; for( i = 0; i =n; i) { vtmp.push_back(vi[i]); } for( i = 0; [阅读全文] [PDF]