摘要:
Q: 有重复元素的全排列问题。DFS,注意筛选条件。 vector > permuteUnique(vector &num) { // Start typing your C/C++ solution below // DO NOT write int main() function vector path; vector > result; vector bvisited(num.size(),false); sort(num.begin(),num.end()); /... 阅读全文
摘要:
Q:全排列问题。DFS。 vector > permute(vector &num) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > result; vector set; vector bvisited(num.size()); permute_aux(num,bvisited,set,result); return result; ... 阅读全文
摘要:
求子集合C(n,k)问题;---DFS vector > combine(int n, int k) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > result; if(nn) return result; vector set; subset(0,n,k,set,result); return result; } vo... 阅读全文