Package g0001_0100.s0053_maximum_subarray

Class Solution

java.lang.Object

g0001_0100.s0053_maximum_subarray.Solution

public class Solution
extends Object

53 - Maximum Subarray\. Easy 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.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxSubArray(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxSubArray

public int maxSubArray(int[] nums)