Notice
250x250
Recent Posts
Recent Comments
Link
목록카데인알고리즘 (1)
넘치게 채우기
[LeetCode] 53. Maximum Subarray
https://leetcode.com/problems/maximum-subarray/description/ Maximum Subarray - LeetCode Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has t leetcode.com 문제 유형 : 다이나믹 프로그래밍 / 카데인 알고리즘 문제 난이도 : Medi..
PS/LeetCode
2023. 5. 29. 22:25