↓快轉到主要內容

Dynamic-Programming

LeetCode 712: Minimum ASCII Delete Sum for Two Strings

2026-07-21·3 分鐘

LeetCode Medium Dynamic-Programming String

LeetCode 712 解題筆記，依照原始 learning note 重新整理

LeetCode 1312: Minimum Insertion Steps to Make a String Palindrome

2026-07-21·3 分鐘

LeetCode Hard Dynamic-Programming String Palindrome

LeetCode 1312 解題筆記，依照原始 learning note 重新整理

LeetCode 583: Delete Operation for Two Strings

2026-07-19·3 分鐘

LeetCode Medium Dynamic-Programming String

LeetCode 583 解題筆記，依照原始 learning note 重新整理

LeetCode 115: Distinct Subsequences

2026-07-19·3 分鐘

LeetCode Hard Dynamic-Programming String

LeetCode 115 解題筆記，依照原始 learning note 重新整理

LeetCode 97: Interleaving String

2026-07-16·3 分鐘

LeetCode Medium Dynamic-Programming String

LeetCode 97 解題筆記，依照原始 learning note 重新整理

LeetCode 72: Edit Distance

2026-07-16·3 分鐘

LeetCode Medium Dynamic-Programming String

LeetCode 72 解題筆記，依照原始 learning note 重新整理

LeetCode 516: Longest Palindromic Subsequence

2026-07-11·2 分鐘

LeetCode Medium Dynamic-Programming String Palindrome

LeetCode 516 解題筆記，依照原始 learning note 重新整理

LeetCode 1143: Longest Common Subsequence

2026-07-11·3 分鐘

LeetCode Medium Dynamic-Programming String

LeetCode 1143 解題筆記，依照原始 learning note 重新整理

LeetCode 576: Out of Boundary Paths

2026-07-05·3 分鐘

LeetCode Medium Dynamic-Programming Grid-Dp

LeetCode 576 解題筆記，依照原始 learning note 重新整理

LeetCode 1289: Minimum Falling Path Sum II

2026-07-05·3 分鐘

LeetCode Hard Dynamic-Programming Grid-Dp

LeetCode 1289 解題筆記，依照原始 learning note 重新整理

LeetCode 931: Minimum Falling Path Sum

2026-07-04·3 分鐘

LeetCode Medium Dynamic-Programming Grid-Dp

LeetCode 931 解題筆記，依照原始 learning note 重新整理

LeetCode 1277: Count Square Submatrices With All Ones

2026-07-04·3 分鐘

LeetCode Medium Dynamic-Programming Grid-Dp

LeetCode 1277 解題筆記，依照原始 learning note 重新整理