Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit e27175bc10e6 · 2020-09-06T16:53:08.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -58,13 +58,16 @@ else if(arr[i-1] == j){
         return getMin(index, sum);
     }
 
-    public static int getSum(int arr[]){
-        if(arr.length <= 0){
-            return 0;
-        }
+    /**
+     * Calculate sum of array elements
+     *
+     * @param arr the array
+     * @return sum of given array
+     */
+    public static int getSum(int[] arr) {
         int sum = 0;
-        for(int i = 0; i < arr.length; i++){
-            sum += arr[i];
+        for (int temp : arr) {
+            sum += temp;
         }
         return sum;
     }
