Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 3e727e3ff51e · 2020-09-06T16:54:10.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -81,13 +81,12 @@ public static int getMin(int[] arr, int sum) {
         return min;
     }
 
-    public static void main(String args[]){
-        Scanner in = new Scanner(System.in);
-        int n = in.nextInt();
-        int arr[] = new int[n];
-        for(int i = 0 ; i<n; i++){
-            arr[i] = in.nextInt();
-        }
-        System.out.println(subSet(arr));
+    /**
+     * Driver Code
+     */
+    public static void main(String[] args) {
+        assert subSet(new int[]{1, 6, 11,5}) == 1;
+        assert subSet(new int[]{36, 7, 46, 40}) == 23;
+        assert subSet(new int[]{1, 2, 3, 9}) == 3;
     }
 }
