参考https://oj.leetcode.com/problems/distinct-subsequences 动态规划方程 dp[i][j]=dp[i-1][j-1]+dp[i-1][j] (s(i)==t(i)) dp[i][j]=dp[i-1][j]; 边界条件:  iif(j==0) d[i][j]=1; 自己画个矩阵看看. 可能出错, 1.直接递归超时 public class Solution { public int numDistinct(String S, String T)…

根据issac3 用Java总结了backtracking template, 我用他的方法改成了Python. 以下为template. def backtrack(ans, temp, nums, start): # 可能有start, 也可能没有 if len(temp) == len(nums): ans.append(temp) else: for i in range(start, len(nums)): if nums[i] not in temp: backtrack(ans,…

碎碎念: 最近终于开始刷middle的题了,对于我这个小渣渣确实有点难度,经常一两个小时写出一道题来.在开始写的几道题中,发现大神在discuss中用到回溯法(Backtracking)的概率明显增大.感觉如果要顺利的把题刷下去,必须先要把做的几道题题总结一下. 先放上参考的web: https://segmentfault.com/a/1190000006121957 http://summerisgreen.com/blog/2017-07-07-2017-07-07-算法技巧-backtr…

# -*- coding: utf8 -*-'''https://oj.leetcode.com/problems/regular-expression-matching/ Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matchin…

#include <malloc.h> int MAX(int x,int y){ return x>y?x:y;} int rob(int* nums, int numsSize) { int *m; int i; m = (int *)malloc(sizeof(int)*(numsSize+1)); m[0] = 0; m[1] = nums[0]; m[2] =MAX(nums[0],nums[1]); for(i=3;i<=numsSize;i++){ m[i] = MA…

Longest Palindromic Substring -- HARD 级别 Question SolutionGiven a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 经典的DP题目. 主页君给出3种解…

800. Similar RGB Color class Solution { int getn(int k){ return (k+8)/17; } string strd(int k){ char ret[3]; if(k<=9){ ret[1]=char(k+'0'); ret[0]=char(k+'0'); } else{ ret[0]=char(k-10+'a'); ret[1]=char(k-10+'a'); } ret[2]='\0'; return string(ret); }…

LeetCode: Palindrome 回文相关题目汇总 LeetCode: Palindrome Partitioning 解题报告 LeetCode: Palindrome Partitioning II 解题报告 Leetcode:[DP]Longest Palindromic Substring 解题报告 LeetCode: Valid Palindrome 解题报告…

Yet Another Source Code for LintCode Current Status : 232AC / 289ALL in Language C++, Up to date (2016-02-10) For more problems and solutions, you can see my LintCode repository. I'll keep updating for full summary and better solutions. See cnblogs t…

Java Algorithm Problems 程序员的一天 从开始这个Github已经有将近两年时间, 很高兴这个repo可以帮到有需要的人. 我一直认为, 知识本身是无价的, 因此每逢闲暇, 我就会来维护这个repo, 给刷题的朋友们一些我的想法和见解. 下面来简单介绍一下这个repo: README.md: 所有所做过的题目 ReviewPage.md: 所有题目的总结和归纳(不断完善中) KnowledgeHash2.md: 对所做过的知识点的一些笔记 SystemDesign.md:…