2020年7月28日
712. Minimum ASCII Delete Sum for Two Strings
摘要： Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Input: s1 = "sea", s2 = "eat" Output: 阅读全文
posted @ 2020-07-28 11:53 Schwifty 阅读(129) 评论(0) 推荐(0)
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 cha 阅读全文
posted @ 2020-07-28 11:11 Schwifty 阅读(92) 评论(0) 推荐(0)
1092. Shortest Common Supersequence
摘要： Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any 阅读全文
posted @ 2020-07-28 09:37 Schwifty 阅读(218) 评论(0) 推荐(0)
437. Path Sum III
摘要： You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文
posted @ 2020-07-28 03:51 Schwifty 阅读(113) 评论(0) 推荐(0)