Merge pull request #97 from ayushijain22/patch-3

Added solution to problem.39 combination Sum

Author: larissalages

leetcode/CombinationSum

@@ -0,0 +1,19 @@
+class CombinationSum {
+    public List<List<Integer>> combinationSum(int[] candidates, int target) {
+        List<List<Integer>>res=new ArrayList();
+        backtrack(candidates,0,target,new ArrayList(),res);{
+            return res;
+        }}
+        private void backtrack(int[]cand,int start,int target,List<Integer>list,List<List<Integer>>result){
+            if(target<0)
+                return;
+             else if(target==0)
+                result.add(new ArrayList<>(list));
+            for(int i=start;i<cand.length;i++)
+            {
+                
+               list.add(cand[i]);
+                backtrack(cand,i,target-cand[i],list,result);
+                list.remove(list.size()-1);
+        }}
+    }

leetcode/java/CombinationSum.java

@@ -0,0 +1,19 @@
+class CombinationSum {
+    public List<List<Integer>> combinationSum(int[] candidates, int target) {
+        List<List<Integer>>res=new ArrayList();
+        backtrack(candidates,0,target,new ArrayList(),res);{
+            return res;
+        }}
+        private void backtrack(int[]cand,int start,int target,List<Integer>list,List<List<Integer>>result){
+            if(target<0)
+                return;
+             else if(target==0)
+                result.add(new ArrayList<>(list));
+            for(int i=start;i<cand.length;i++)
+            {
+                
+               list.add(cand[i]);
+                backtrack(cand,i,target-cand[i],list,result);
+                list.remove(list.size()-1);
+        }}
+    }