Package g0001_0100.s0053_maximum_subarray

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    53 - Maximum Subarray.

    Medium

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>4</sup><= numsi<= 10<sup>4</sup></code>

    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.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxSubArray(IntArray nums)

      • Methods inherited from class java.lang.Object

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