frankming

2022年4月8日

摘要：题目 Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three operati 阅读全文

posted @ 2022-04-08 15:46 frankming 阅读(28) 评论(0) 推荐(0)

[leetcode] 583. Delete Operation for Two Strings

摘要：题目 Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same. In one step, you can delete exactl 阅读全文

posted @ 2022-04-08 15:08 frankming 阅读(37) 评论(0) 推荐(0)

2022年4月7日

[leetcode] 673. Number of Longest Increasing Subsequence

摘要：题目 Given an integer array nums, return the number of longest increasing subsequences. Notice that the sequence has to be strictly increasing. Example 阅读全文

posted @ 2022-04-07 13:36 frankming 阅读(37) 评论(0) 推荐(0)

2022年4月6日

[leetcode] 300. Longest Increasing Subsequence

摘要：题目 Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that can be derived from 阅读全文

posted @ 2022-04-06 17:11 frankming 阅读(27) 评论(0) 推荐(0)

[leetcode] 139. Word Break

摘要：题目 Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary 阅读全文

posted @ 2022-04-06 14:28 frankming 阅读(37) 评论(0) 推荐(0)

[leetcode] 91. Decode Ways

摘要：题目 An integer array is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the s 阅读全文

posted @ 2022-04-06 11:50 frankming 阅读(27) 评论(0) 推荐(0)

2022年4月2日

[leetcode] 413. Arithmetic Slices

摘要：题目 An integer array is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the s 阅读全文

posted @ 2022-04-02 17:26 frankming 阅读(35) 评论(0) 推荐(0)

[leetcode] 5. Longest Palindromic Substring

摘要：题目 Given a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid ans 阅读全文

posted @ 2022-04-02 15:14 frankming 阅读(22) 评论(0) 推荐(0)

[leetcode] 62. Unique Paths

摘要：题目 There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom- 阅读全文

posted @ 2022-04-02 14:36 frankming 阅读(19) 评论(0) 推荐(0)

[leetcode] 45. Jump Game II

摘要：题目 Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents yo 阅读全文

posted @ 2022-04-02 14:29 frankming 阅读(42) 评论(0) 推荐(0)

天行有常，不为尧存，不为桀亡。循道而不贰，则天不能祸。

公告