# maximum-subarray

## Problem

[Maximum Subarray](https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/528/week-1/3285/)

## Problem Description

```
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.
```

## Solution 1 (linear)

![maximum subarray](https://388701358-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LmDY11BLFD0Iupj9U9t%2F-M4ScH4O9QNwD1TKeD-c%2F-M4ScT9QYfJOztF-dhlM%2Fmaximum-subarray.png?generation=1586413825641456\&alt=media)

```java
class Solution {
    public int maxSubArray(int[] nums) {
        // corner case check
        if (nums == null || nums.length == 0) return 0;
        int len = nums.length;
        int max = nums[0];
        int sum = 0;
        for (int i = 0; i < len; i++) {
            sum += nums[i];
            max = Math.max(sum, max);
            // reset sum to 0 when sum < 0.
            if (sum < 0) sum = 0;
        }
        return max;
    }
}
```

## Solution 2 (divide and conquer)

// TODO: add divide and conquer solution


---

# 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://snowan.gitbook.io/study-notes/leetcode/30daychallenge/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.