문제 https://leetcode.com/problems/jump-game/description/?source=submission-noac LeetCode - The World's Leading Online Programming Learning Platform 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 접근 DP를 생각했다. $ A_{n} $까지 점프할 수 있는 $ A_{n-1}, A_{n-4}, A_{n-7} .... $ 이 있다면 $ A_{n-1} $까지 점프할 수 있..

문제 https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/?envType=study-plan-v2&envId=top-interview-150 LeetCode - The World's Leading Online Programming Learning Platform 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 저점(buy), 고점(sell)을 변수로 두고 생각했는데 O(n^2) 밖에 안떠올랐고 Dis..