313. Maximum Sum Circular Subarray
MediumDynamic Programming
Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums. A circular array means the end of the array connects to the beginning of the array. Formally, the next element of nums[i] is nums[(i + 1) % n] and the previous element of nums[i] is nums[(i - 1 + n) % n]. A subarray may only include each element of the fixed buffer nums at most once.
Examples
Input: [1,-2,3,-2]
Output: 3
Explanation: The subarray [3] has the maximum sum 3.
Constraints
- n == nums.length
- 1 <= n <= 3 * 10^4
- -3 * 10^4 <= nums[i] <= 3 * 10^4
Loading...
Run checks all cases above. Submit evaluates all test cases.