首页 > 代码库 > Subsets
Subsets
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For example, if S = [1,2,3], a solution is: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ].
回溯法，代码如下：
void subset(vector<int> vecInt){ sort(vecInt.begin(), vecInt.end()); vector<int> vecWorker; subsetsHelper(vecWorker, vecInt, 0);}void subsetHelper(vector<int>& vecWorker, const vector<int>& vecInt, int pos){ outputToResult(vecWorker); for (int i = pos; i < vecInt.length(); i++) { vecWorker.push_back(vecInt[i]); subsetHelper(vecWorker, vecInt, i+1); vecWorker.pop_back(); }}
Subsets
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。