LintCode-41. 最大子数组

public class Solution {
    /**
     * @param nums: A list of integers
     * @return: A integer indicate the sum of max subarray
     */
    public int maxSubArray(int[] nums) {
        // write your code here
        int sum = nums[0];
        for(int i = 0; i < nums.length; i++){
            int temp = 0;
            for(int j = i; j < nums.length; j++){
                temp += nums[j];
                if(temp > sum) sum = temp;
            }
        }
        return sum;
    }
}