Leetcode 53.Maximum Subarray(Kadane, brute-force algorithm)

문제. 숫자형 array nums가 주어졌을 때 인접한 subarray 중 가장 큰 sum 을 반환하라 Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6. https://leetcode.com/problems/maximum-subarray/ Maximum Subarray - LeetCode Level up your coding skills and quickly land a job.

This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 처음 접근은 for문으.....