sji

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/count-binary-substrings/ Count Binary Substrings - 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 idea: convert into [group_cnt, group_cnt, ... ] 290ms import collections class Solution: def countBinarySubstrings(self, s: str) -> int: buf = [] is_zero..