摘要: 1.分治法求全排列void perm(char a[],int start,int end){ if(start==end) { printf("%s\n",a); return; } else { ... 阅读全文
posted @ 2016-06-08 20:49 Nickqiao 阅读(133) 评论(0) 推荐(0)