算法分析与设计作业

算法分析与设计作业题
作业来源

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.

public class Solution {
    public int maxSubArray(int[] nums) {
        int len = nums.length;
        if(len == 0){
            return 0;
        }
        
        int max = nums[0];
        for(int i=0; i<len; i++){
            int sum =0;
            for(int j=i; j<len; j++){
                sum += nums[j];
                max = (max > sum ? max : sum);
            }
        }
        return max;
    }
}

时间复杂度:O(n2) , 空间复杂度:O(1)