LeetCode

문제You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.Given an integer array nums representing the amount of mone..

문제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.풀기우선 난 못풀었다(..)내가 생각한 방법..