剑指Offer-31

题目：

实现

// coding = java
public class Solution31 {
    public static int findGreatSum(int[] nums){
        if(nums==null || nums.length<1){
            return 0;
        }
        int cur_sum = 0;
        int great_sum = Integer.MIN_VALUE;
        for(int i=0;i<nums.length;i++){
            if(cur_sum<=0){
                cur_sum=nums[i];
            }
            else {
                cur_sum+=nums[i];
            }
            if(cur_sum>great_sum){
                great_sum = cur_sum;
            }
        }
        return great_sum;
    }

    public static void main(String[] args) {
        int[] data = {1, -2, 3, 10, -4, 7, 2, -5};
        int[] data2 = {-2, -8, -1, -5, -9};
        int[] data3 = {2, 8, 1, 5, 9};

        System.out.println(findGreatSum(data));
        System.out.println(findGreatSum(data2));
        System.out.println(findGreatSum(data3));
    }
}