silent_crown的博客

39. 组合总和 https://leetcode-cn.com/problems/combination-sum/ 40. 组合总和 II https://leetcode-cn.com/problems/combination-sum-ii/ 216. 组合总和 III https://leetcode-cn.com/problems/combination-sum-i...

https://leetcode-cn.com/problems/regular-expression-matching/ 思路:动态规划 dp：(len(s) +1)* (len(p) + 1) dp[ii][jj]代表s[0,i-1]和p[0,j-1]是否匹配，故有ii=i+1,jj=j+1。也就是说i,j对应比较时候改变的是dp[i+1][j+1]时的位置。 边界情况,s='',需要...

class Solution(object): def adjust_to_min_heap(self, arr, i, end): while i < end: l = 2 * i + 1 r = 2 * i + 2 min_ind = i if l < end ...

121. 买卖股票的最佳时机 https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/ 122. 买卖股票的最佳时机 II https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/ 123. 买卖股票的最佳时机 III h...