[LeetCode] 53. Maximum Subarray - 문제풀이
Description 주어진 배열(nums)의 subarray중 가장 큰 인접한 수를 갖는 배열을 찾아서 값을 반환하는 문제입니다. 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] Outpu..
