mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-09 03:59:38 +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);
|
||||
}
|
||||
|
||||
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;
|
||||
}
|
||||
|
Reference in New Issue
Block a user