Add Solution of 78 int cpp and go

Author: KongJHong

solution/0015.3Sum/Solution.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    vector<vector<int>> subsets(vector<int>& nums) {
+        vector<vector<int>> ans;
+        vector<int> tmp;
+        int n = nums.size();
+        dfs(ans,nums,tmp,0,n);
+        
+        return ans;
+    }
+    
+    
+    void dfs(vector<vector<int>> &ans,vector<int>& nums,vector<int> &tmp,int k,int n){
+        ans.push_back(tmp);
+        for(int i = k;i < n;i++)
+        {
+            tmp.push_back(nums[i]);
+            dfs(ans,nums,tmp,i+1,n);
+            tmp.pop_back();
+        }
+    }
+};

solution/0078.Subsets/Solution.cpp

@@ -0,0 +1,21 @@
+func subsets(nums []int) [][]int {
+    n := len(nums)
+    ans := make([][]int,0)
+    tmp := make([]int,0)   
+    dfs(&ans,tmp,nums,0,n)
+    
+    return ans
+}
+
+
+func dfs(ans *[][]int,tmp []int,nums []int,k,n int) {
+    tmpVec := make([]int,len(tmp))
+    copy(tmpVec,tmp)
+    *ans = append(*ans,tmpVec)
+    
+    for i:=k;i < n;i++{
+        tmp = append(tmp,nums[i])
+        dfs(ans,tmp,nums,i+1,n)
+        tmp = tmp[:len(tmp) - 1]
+    }
+}