LeetCode-53. Maximum Subarray [C++][Java]

LeetCode-53. Maximum Subarrayhttps://leetcode.com/problems/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.

A subarray is a contiguous part of an array.

Example 1:

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

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [5,4,-1,7,8]
Output: 23

Constraints:

• 1 <= nums.length <= 105
• -104 <= nums[i] <= 104

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.

解题思路

一维动态规划

【C++】

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        if(nums.size() == 0) {return 0;}
        int maxsum = nums[0], tempsum = nums[0]; //注意初始值 不能设为0 防止只有负数
        for(int i = 1; i < nums.size(); i++) {
            tempsum = (tempsum < 0) ? nums[i] : tempsum + nums[i];
            maxsum = (tempsum > maxsum) ? tempsum : maxsum;
        }
        return maxsum;
    }
};

【Java】

class Solution {
    public int maxSubArray(int[] nums) {
        if(nums.length == 0) {return 0;}
        int maxsum = nums[0], tempsum = nums[0]; //注意初始值 不能设为0 防止只有负数
        for(int i = 1; i < nums.length; i++) {
            tempsum = (tempsum < 0) ? nums[i] : tempsum + nums[i];
            maxsum = (tempsum > maxsum) ? tempsum : maxsum;
        }
        return maxsum;
    }
}

《剑指offer》同类型题目

《剑指offer》42--连续子数组的最大和[C++]_贫道绝缘子的博客-CSDN博客给一个数组，返回它的最大连续子序...https://blog.csdn.net/qq_15711195/article/details/96964856