# 53.Maximum Subarray

**53.Maximum Subarray**

难度:Easy

> 给定一个整数数组 nums ，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。

```
示例:

输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大，为 6。
进阶:

如果你已经实现复杂度为 O(n) 的解法，尝试使用更为精妙的分治法求解。
```

从头遍历一遍，当sum<0时放弃前面的序列从新开始。

```
class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        if(nums.empty())return 0;
        if(nums.size()==1) return nums[0];
        int sum=0;
        int res=nums[0];
        for(auto n: nums)
        {
            sum = sum>0 ? sum+n : n;
            res= res > sum ? res:sum;
        }
        return res;
    }
};
```

> 执行用时 :8 ms, 在所有 C++ 提交中击败了92.41%的用户\
> 内存消耗 :9 MB, 在所有 C++ 提交中击败了96.70%的用户


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/53.maximum_subarray.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.