subset sum problem dynamic programming

Author: dheeraj9198

src/dymanicProgramming/SubsetSumProblem.java

@@ -5,9 +5,8 @@
  */
 public class SubsetSumProblem {
 
-    private static boolean[][] sol;
-
-    private static Boolean isSubsetSum(int[] set, int sum) {
+    private static boolean isSubsetSum(int[] set, int sum) {
+        boolean[][] sol = new boolean[set.length][sum + 1];
         for (int x = 0; x < set.length; x++) {
             for (int k = 0; k <= sum; k++) {
                 if (set[x] == k) {
@@ -26,7 +25,6 @@ private static Boolean isSubsetSum(int[] set, int sum) {
     public static void main(String[] strings) {
         int set[] = {3, 34, 4, 12, 5, 2};
         int sum = 29;
-        sol = new boolean[set.length][sum + 1];
         if (isSubsetSum(set, sum))
             System.out.println("Found a subset with given sum");
         else