[leetcode] 583. Delete Operation for Two Strings

Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.數組 Example 1: 緩存 Input: "s
相關文章
相關標籤/搜索