> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/53.-maximum-subarray.md).

# 53. Maximum Subarray

Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array \[-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray \[4,-1,2,1] has the largest sum = 6.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
   public int maxSubArray(int[] nums) {
        int max = Integer.MIN_VALUE;
        int runner = 0;

        for (int i = 0; i < nums.length; i++) {
            runner += nums[i];

            if (max < runner) {
                max = runner;
            }

            if (runner < 0)
                runner = 0;
        }

        return max;
    }
}
```