sji

https://leetcode.com/problems/shopping-offers/ Shopping Offers - 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 음.. 요즘에는 예전과는 다르게, 최적 값 찾는 문제를 테이블로 어떻게 접근할 것인지 부터 생각하고있네 예전엔 반대였는데 아무튼, 긍정적인 신호고 반대로 DP문제에서 테이블 접근에 있어서 답이 도저히 안나 올 때는 그냥 직관적으로 recursion을 이용해 코드를 풀어 쓰고, memoization을 적..

https://leetcode.com/problems/edit-distance/ Edit Distance - 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 방향에 의미 부여하기 328 ms class Solution: def minDistance(self, word1: str, word2: str) -> int: if len(word1) == 0 or len(word2) == 0: return max(len(word1), len(word2)) dp = [] fo..

https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - 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 95%!!! 376ms class Solution: def longestCommonSubsequence(self, text1: str, text2: str) -> int: dp = [] for r in range(len(text1)+1): dp.append([0]..

https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/ Number of Dice Rolls With Target Sum - 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 tweaked target sum 456ms class Solution: def numRollsToTarget(self, d: int, f: int, target: int) -> int: dp = [0] * (target + 1..

https://leetcode.com/problems/longest-increasing-subsequence/ Longest Increasing Subsequence - 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 윽 어려웠다! 어레이가 주어졌을 때 증가하는 수열로만 이루어지면서 가장 긴 subseq를 찾는 문제다. 처음엔 정렬하고나서 인덱스로 뭐 어떻게 해보면 되지 않을까 생각해봤는데, 정렬하고 나서도 결국 증가하는 인덱스로만 이루어진 배열을 찾아야되서 결국..