algorithm1 [leetcode] week1 - Maximum Subarray https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/528/week-1/3285/ Account Login - 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 어려워서 검색해보니 위키에 간단하게 소개가 돼 있었다. : Maximum_subarray_problem 2차원 배열 bruth-force : O(n6) 수식을 사용해서 1차원 배열 bruth-force로 해결 : O(n2) - 내가.. 2020. 4. 12. 이전 1 다음
