解题思路1:
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param array int整型一维数组
* @return int整型一维数组
*/
public int[] FindGreatestSumOfSubArray (int[] array) {
// write code here
int n = array.length;
int[] dp = new int[n];
dp[0] = array[0];
int max = dp[0], start = 0, end = 1, temp=0;
for(int i = 1; i < n; i++){
if(dp[i-1] + array[i] < array[i]){
dp[i] = array[i];
temp = i;
}else{
dp[i] = dp[i-1] + array[i];
}
if(dp[i] >= max){
max = dp[i];
start = temp;
end = i + 1;
}
}
return Arrays.copyOfRange(array, start, end);
}
}