xinyu04

摘要： 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 exactly o 阅读全文

摘要： Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence o 阅读全文

摘要： Person x and y have the following conversation: x: I forgot how old your three kids are. y: The product of their ages is 36. x: I still don't know the 阅读全文

摘要： You need to warm milk in a baby bottle from its initial temperature of 15 degrees centigrade to 25 degrees. You put the bottle in a pot of boiling wat 阅读全文

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