2017.04.23 change

mhcoderwl · mhcoderwl · commit 9848bca40a58 · 2017-04-23T09:43:52.000+08:00
diff --git a/8.1.cpp b/8.1.cpp
@@ -0,0 +1,42 @@
+//给一个数组没有重复数字,返回它所有的子数组(子数组非降序)//
+#include<iostream>
+#include<vector>
+#include<algorithm>
+#include<set>
+using namespace std;
+//深搜
+class Solution{
+public:
+	vector<vector<int>> subsets(vector<int>& nums){
+		set<vector<int>> result;
+		vector<int> cur;
+		subsets(nums,cur,result,0);
+		vector<vector<int>> real_result;
+		copy(result.begin(),result.end(),back_inserter(real_result));
+		return real_result;
+	}
+	void subsets(vector<int>& nums,vector<int>& cur,set<vector<int>>& result,int step){
+		if(step==nums.size()){
+			result.insert(cur);
+			return;
+		}
+		subsets(nums,cur,result,step+1);
+		cur.push_back(nums[step]);
+		subsets(nums,cur,result,step+1);
+		cur.pop_back();
+	}
+};
+
+
+
+int main(){
+	Solution s;
+	vector<int> nums={1,2,2,3};
+	auto result=s.subsets(nums);
+	for(auto i:result){
+		for(auto j:i)
+			cout<<j<<' ';
+		cout<<endl;
+	}
+}
+
diff --git a/8.2.cpp b/8.2.cpp
@@ -0,0 +1,11 @@
+//给一个数组(有重复),求所有的子数组(不能重复)//
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+//迭代
+class Solution{
+	vector<vector<int>> subsetsWithDup(vector<int>& nums){
+		sort(nums.begin(),nums.end());
+
+
diff --git a/8.3.cpp b/8.3.cpp
@@ -0,0 +1,45 @@
+//给一个数组,返回所有序列//
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+class Solution{
+public:
+	vector<vector<int>> permutation(vector<int>& nums){
+		sort(nums.begin(),nums.end());
+		vector<vector<int>> result;
+		do{
+			result.push_back(nums);
+		}while(next_permutation(nums.begin(),nums.end()));
+		return result;
+	}
+	
+template<typename Iterator>
+	bool next_permutation(Iterator first,Iterator last){
+		auto rfirst=reverse_iterator<Iterator>(last);
+		auto rlast=reverse_iterator<Iterator>(first);
+		auto cur=next(rfirst);
+		while(*cur>*prev(cur)&&cur!=rlast)cur=next(cur);
+		if(cur==rlast)return false;
+		auto change=find_if(rfirst,cur,bind1st(less<int>(),*cur));
+		swap(*change,*cur);
+		reverse(rfirst,cur);
+		return true;
+	}
+};
+
+int main(){
+	Solution s;
+	vector<int> nums={1,2,3,4};
+	auto result=s.permutation(nums);
+	for(auto i:result){
+		for(auto j:i)
+			cout<<j<<' ';
+		cout<<endl;
+	}
+}
+
+
+
+		
+		
diff --git a/8.4.cpp b/8.4.cpp
diff --git a/8.5.cpp b/8.5.cpp
@@ -0,0 +1,36 @@
+//返回从1-n的k个数的所有组合//
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+class Solution{
+public:
+	vector<vector<int>> combine(int n,int k){
+		vector<vector<int>> result;
+		vector<int> cur;
+		dfs(result,cur,1,n,k);
+		return result;
+
+	}
+	void dfs(vector<vector<int>>& result,vector<int> cur,int index,int n,int k){
+		if(cur.size()==k){
+			result.push_back(cur);
+			return;
+		}
+		if(n-index+1<k-cur.size())
+			return;
+		dfs(result,cur,index+1,n,k);
+		cur.push_back(index);
+		dfs(result,cur,index+1,n,k);
+		cur.pop_back();
+	}
+};
+int main(){
+	Solution s;
+	auto result=s.combine(4,2);
+	for(auto i:result){
+		for(auto j:i)
+			cout<<j<<' ';
+		cout<<endl;
+	}
+}
diff --git a/8.6.cpp b/8.6.cpp
