LeetCode53.最大子序和（递归）

妖狐艹你老母 2022-02-01 11:53 157阅读 0赞

# 题目： #

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70 1]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70 2]

# 代码: #

public class Solution { 
        int max = Integer.MIN_VALUE;
        public int maxSubArray(int[] nums) { 
            if(nums == null || nums.length == 0){ 
                return 0;
            }
            if(nums.length == 1){ 
                return nums[0];
            }
            maxSum(nums,nums.length - 1);
            return max;
        }
    
        /*** * 返回包含当前点在内的连续的最大自序和 * @param nums * @param i 当前遍历到的位置 * @return */
        public int maxSum(int[] nums,int i){ 
            if(i == 0){ 
                max = nums[0];
                return nums[0];
            }
    // 包含当前点在内的最大自序和 = 该点之前连续的最大和 + 该点值 或 该点值
            int preMax = maxSum(nums,i - 1);
            int currMax = Math.max(preMax + nums[i],nums[i]);
            max = Math.max(currMax,max);
            return currMax;
        }
    
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70]: /images/20220201/36714e8f60444051be45562baa3aa763.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70 1]: /images/20220201/6bcfa173940b4d9fa7a96980a6c15d42.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzA5MzUwMQ_size_16_color_FFFFFF_t_70 2]: /images/20220201/5deba51ab5f3467e84d80c77cee7dc4a.png