[LeetCode] Maximum Subarray
·
공부/코딩테스트 | 알고리즘
문제Given an integer array nums, find the subarray with the largest sum, and return its sum. 예시Input: nums = [-2,1,-3,4,-1,2,1,-5,4]Output: 6Explanation: The subarray [4,-1,2,1] has the largest sum 6.Input: nums = [1]Output: 1Explanation: The subarray [1] has the largest sum 1.Input: nums = [5,4,-1,7,8]Output: 23Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.풀기우선 난 못풀었다(..)내가 생각한 방법..