mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-11 14:12:36 +08:00
Update DynamicProgramming/MinimumSumPartition.java
Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
@ -58,13 +58,16 @@ public class MinimumSumPartition
|
|||||||
return getMin(index, sum);
|
return getMin(index, sum);
|
||||||
}
|
}
|
||||||
|
|
||||||
public static int getSum(int arr[]){
|
/**
|
||||||
if(arr.length <= 0){
|
* Calculate sum of array elements
|
||||||
return 0;
|
*
|
||||||
}
|
* @param arr the array
|
||||||
|
* @return sum of given array
|
||||||
|
*/
|
||||||
|
public static int getSum(int[] arr) {
|
||||||
int sum = 0;
|
int sum = 0;
|
||||||
for(int i = 0; i < arr.length; i++){
|
for (int temp : arr) {
|
||||||
sum += arr[i];
|
sum += temp;
|
||||||
}
|
}
|
||||||
return sum;
|
return sum;
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user