53. Maximum Subarray

题目：

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

我的解答：（效率较低）

class Solution {
    public int maxSubArray(int[] nums) {
        int len = nums.length;
        int[] sumArray = new int[len];
        sumArray[len-1] = nums[len-1];
        for(int i = 0; i < len-1; i++) { //make copy with First len-1
            sumArray[i] = nums[i];
            if(sumArray[len-1] < sumArray[i]) {
                sumArray[len-1] = sumArray[i];
            }
        }
        for(int i = 1; i < len; i++) {
            for(int j = 0; j < len-i; j++) {
                sumArray[j] = sumArray[j] + nums[j+i];
                if(sumArray[len-1] < sumArray[j]) {
                    sumArray[len-1] = sumArray[j];
                }
            }
        }
        return sumArray[len-1];
    }
}