1-D DP:
Climbing Stairs:
Naive 就是sum[0]; if (n==0) sum[0]++;
然后climbstairs(n-1)
climbstairs(n-2)
public int climbStairs(int n) {
if (n<=0) return 0;
if (n==1) return 1;
int[] d = new int[n+1];
d[0]=1;
d[1]=1;
for (int i=2;i<=n;i++) {
d[i]=d[i-1]+d[i-2];
}
return d[n];
}Decode Ways:
分类写清楚
char在string里的pos和在d[]里的位置搞清楚(differ by 1)
public int numDecodings(String s) {
if (s.length()==0) return 0;
if (s.charAt(0)=='0') return 0;
if (s.length()==1) return 1;
int num0=1;
int num1=1;
int num2=1;
for (int i=2;i<=s.length();i++) {
char a = s.charAt(i-1);
char b = s.charAt(i-2);
if (a=='0') {
if (b=='1' ||b=='2') num2=num0;
else return 0;
} else if (a>='1' && a<='6') {
if (b=='1' ||b=='2') num2=num1+num0;
else num2=num1;
} else {
if (b=='1') num2=num1+num0;
else num2=num1;
}
num0=num1;
num1=num2;
}
return num2;
}Unique Binary Search Trees
catalan number: d[i]=sum(d[j]*d[i-j-1]) j=0..i-1
public int numTrees(int n) {
if (n==0) return 0;
if (n==1) return 1;
int[] d = new int[n+1];
d[0]=1;
for (int i=1;i<=n;i++) {
for (int j=0;j<i;j++) {
d[i]+=d[j]*d[i-j-1];
}
}
return d[n];
}Maximum Subarray
public int maxSubArray(int[] A) {
if (A==null||A.length==0) return 0;
if (A.length==1) return A[0];
int max = A[0];
int local = A[0];
for (int i=1;i<A.length;i++) {
if (local>0) local = local+A[i];
else local = A[i];
max = Math.max(local, max);
}
return max;
}
Maximum Product Subarray
* localMin会被改掉，所以要用temp啊～
public int maxProduct(int[] A) {
if (A==null||A.length==0) return 0;
int max = A[0];
int localMin = A[0];
int localMax = A[0];
for (int i=1;i<A.length;i++) {
int temp = localMin;
localMin = Math.min(A[i]*localMax, Math.min(A[i],A[i]*localMin));
localMax = Math.max(A[i]*temp, Math.max(A[i],A[i]*localMax));
max = Math.max(localMax,max);
}
return max;
}Best Time to Buy and Sell Stock、
public int maxProfit(int[] prices) {
if (prices==null||prices.length==0) return 0;
int local = 0;
int max = 0;
for (int i=0;i<prices.length-1;i++) {
local = Math.max(local-prices[i]+prices[i+1],0);
max = Math.max(local,max);
}
return max;
}Jump Game
* i<=max
public boolean canJump(int[] A) {
if (A==null || A.length==0 ||A.length==1) return true;
if (A[0]==0) return false;
int max = A[0];
for (int i=1;i<A.length && i<=max;i++) {
max = max>A[i]+i ? max : A[i]+i;
}
if (max>=A.length-1) return true;
return false;
}
public int jump(int[] A) {
if (A==null|| A.length==0) return 0;
int lastReach = 0;
int reach = 0;
int step = 0;
for (int i=0;i<=reach&&i<A.length;i++) {
if (i>lastReach) {
step++;
lastReach=reach;
}
reach = Math.max(reach,A[i]+i);
}
if (reach<A.length-1) return 0;
return step;Longest Valid Parentheses
从后往前走 d[i]代表以i开头的最长valid parentheses
递推式： 如果charAt(i)='(' && charAt(end)=')' 就比后面的加2
＊如果end后面也有valid parentheses 就需要加上 (ie. (())() )
public int longestValidParentheses(String s) {
if (s==null||s.length()<=1) return 0;
int max = 0;
int[] dp = new int[s.length()];
for (int i=s.length()-2;i>=0;i--) {
int end = dp[i+1]+i+1;
if (end<s.length() && s.charAt(i)=='(' && s.charAt(end)==')') {
dp[i]=dp[i+1]+2;
if (end+1<s.length()) dp[i]+=dp[end+1];
}
max=Math.max(max, dp[i]);
}
return max;
}Triangle
1. 从上往下走：sum[i]=min(sum[i],sum[i-1])+n[i] 需要单独处理头和尾，最后还要走一遍找max
2. 从下往上走：sum[i]=min(sum[i],sum[i+1])+n[i] 不用处理头尾 代码简洁一些
public int minimumTotal(List<List<Integer>> triangle) {
if (triangle==null||triangle.size()==0) return 0;
int[] sum = new int[triangle.get(triangle.size()-1).size()];
for (int i=triangle.size()-1;i>=0;i--) {
List<Integer> layer = triangle.get(i);
for (int j=0;j<=i;j++) {
if (i==triangle.size()-1) sum[j]=layer.get(j);
else sum[j]=Math.min(sum[j],sum[j+1])+layer.get(j);
}
}
return sum[0];
}
2-D DP:
Palindrome Partitioning II
1. 查palindrome的dp: 一个boolean[i][j]代表从i到j是不是palindrome。 填满右上半部分的matrix，diagonal为1。复杂度n^2
if (s.charAt(i)==s.charAt(j) && (j-i<2 || res[i+1][j-1])) res[i][j]=true;
2. 查min cut的dp: 一个int[]代表到i的min cut。复杂度n^2 （注意j=0的边界情况）
if (dict[j][i]) d[i]=Math.min(d[i], (j==0 ? 0 : d[j-1])+1);
public int minCut(String s) {
if(s==null || s.length()==0) return 0;
boolean[][] dict = getDict(s);
int[] d = new int[s.length()];
for (int i=0; i<s.length(); i++) {
d[i]=i+1;
for (int j=0;j<=i;j++) {
if (dict[j][i]) d[i]=Math.min(d[i], (j==0 ? 0 : d[j-1])+1);
}
}
return d[s.length()-1]-1;
}
private boolean[][] getDict(String s) {
boolean[][] res = new boolean[s.length()][s.length()];
for (int i=s.length()-1;i>=0; i--) {
for (int j=i; j<s.length(); j++)
if (s.charAt(i)==s.charAt(j) && (j-i<2 || res[i+1][j-1])) res[i][j]=true;
}
return res;
}Edit Distance
递推式：d[i][j]=min(d[i][j-1],d[i-1][j],d[i-1][j-1])+1 <==== word1的i==word2的j
d[i][j]=d[i-1][j-1] <=== word1的i!=word2的j
public int minDistance(String word1, String word2) {
if (word1==null||word2==null) return 0;
if (word1.length()==0||word2.length()==0)
return word1.length()==0 ? word2.length():word1.length();
int[][] d = new int[word1.length()][word2.length()];
boolean flag1=false;
boolean flag2=false;
for (int i=0;i<word2.length();i++) {
if (word1.charAt(0)==word2.charAt(i) && !flag1) {
flag1 = true;
d[0][i]=i==0 ? 0 : d[0][i-1];
} else d[0][i]= i==0 ? 1 : d[0][i-1]+1;
}
for (int i=0;i<word1.length();i++) {
if (word2.charAt(0)==word1.charAt(i) && !flag2) {
flag2=true;
d[i][0]= i==0 ? 0 : d[i-1][0];
} else d[i][0] = i==0 ? 1 : d[i-1][0]+1;
}
for (int i=1;i<word1.length();i++) {
for (int j=1;j<word2.length();j++) {
if (word1.charAt(i)==word2.charAt(j))
d[i][j]=d[i-1][j-1];
else d[i][j] = Math.min(d[i][j-1],Math.min(d[i-1][j],d[i-1][j-1]))+1;
}
}
return d[word1.length()-1][word2.length()-1];
}Minimum Path Sum (mxn grid 从 左上到右下 的最小路径）
//h[i][j]=min(h[i+1][j],h[i][j+1])+grid[i][j]
public int minPathSum(int[][] grid) {
if (grid==null||grid.length==0||grid[0].length==0) return 0;
int row = grid.length;
int col = grid[0].length;
int[][] h = new int[grid.length][grid[0].length];
for (int i=row-1;i>=0;i--)
h[i][col-1]= i==grid.length-1? grid[i][col-1] : h[i+1][col-1]+grid[i][col-1];
for (int i=col-2;i>=0;i--)
h[row-1][i]= h[row-1][i+1]+grid[row-1][i];
for (int i=row-2;i>=0; i--) {
for (int j=col-2;j>=0;j--) {
h[i][j]=Math.min(h[i+1][j], h[i][j+1])+grid[i][j];
}
}
return h[0][0];
}Word Break
//a:i-0
//if h[a] true && substring(a+1, i+1) in dict ==> h[i] true
注意第一个case，两个解决办法：
1. h[len+1], h[0]＝true，代表前i个字母能不能word break
2. j=-1;j<i;j++, 然后加if j==-1?true:h[j]
public boolean wordBreak(String s, Set<String> dict) {
if (s==null||dict==null||dict.isEmpty()) return false;
boolean[] h = new boolean[s.length()+1];
h[0]=true;
for (int i=1;i<=s.length();i++) {
for (int j=0;j<i;j++) {
if (h[j] && dict.contains(s.substring(j,i))) {
h[i]=true;
}
}
}
return h[s.length()];
}Word Break II (输出所有可能的solution)
*复杂度取决于结果数量，直接brute force对于结果多的情况跟dp差不多
brute force：
public List<String> wordBreak(String s, Set<String> dict) {
List<String> res = new ArrayList<String>();
if (s==null||dict==null||dict.isEmpty()) return res;
helper(s, 0, new ArrayList<String>(), dict,res);
return res;
}
private void helper(String s, int start, List<String> item, Set<String> dict, List<String> res) {
if (start==s.length()) {
res.add(convert(item));
return;
}
for (int i=start;i<s.length();i++) {
String sub = s.substring(start,i+1);
if (dict.contains(sub)) {
item.add(sub);
helper(s, i+1, item, dict, res);
item.remove(item.size()-1);
}
}
}
private String convert(List<String> item) {
StringBuilder sb = new StringBuilder();
for (String s: item) {
sb.append(s);
sb.append(" ");
}
sb.deleteCharAt(sb.length()-1);
return sb.toString();
}dp + map
先做dp,做的路上把最后的word放到map对应的i里；如果最后可以达到，就做个dfs把所有结果都添加了
注意：dfs时的空格要做check，item是空的时不要加空格
public List<String> wordBreak(String s, Set<String> dict) {
List<String> res = new ArrayList<String>();
Map<Integer, List<String>> map = new HashMap<Integer, List<String>>();
if (s==null||dict==null||dict.isEmpty()) return res;
boolean[] h = new boolean[s.length()];
for (int i=0;i<s.length();i++) {
for (int j=-1;j<i;j++) {
boolean pre = j==-1? true:h[j];
if (pre && dict.contains(s.substring(j+1,i+1))) {
h[i]=true;
if (map.containsKey(i)) map.get(i).add(s.substring(j+1,i+1));
else {
List<String> l = new ArrayList<String>();
l.add(s.substring(j+1,i+1));
map.put(i, l);
}
}
}
}
if (!h[h.length-1]) return res;
dfs(map,h,h.length-1, "", res);
return res;
}
private void dfs(Map<Integer,List<String>> map, boolean[] h, int end, String item, List<String> res) {
if (end<0) {
res.add(item);
return;
}
List<String> list = map.get(end);
for (String word: list) {
dfs(map,h,end-word.length(),word+ (item.length()==0? "": " ")+item,res);
}
}distinct subsequences
dp[i][j]=S[i]==T[j]? dp[i-1][j-1] + dp[i-1][j] : dp[i-1][j] （ie. rabb 和 rab, 如果s[3]==t[2], 数量就是没有s[3]那个b的结果([i-1][j])+ 加上s[3]和t[2]的结果([i-1][j-1])
R A B R <==T
R 1 0 0 0
A 1 1 0 0
B 1 1 1 0
B 1 1 2 0
^
S
public int numDistinct(String S, String T) {
if (S.length()==0 || T.length()==0) return 0;
int[][] dp = new int[S.length()][T.length()];
char[] A = S.toCharArray();
char[] B = T.toCharArray();
int count = 0;
for (int i=0;i<A.length;i++) dp[i][0]=A[i]==B[0]?++count:count;
for (int i=1;i<A.length;i++) {
for (int j=1;j<B.length;j++) dp[i][j]=A[i]==B[j]?dp[i-1][j-1]+dp[i-1][j]:dp[i-1][j];
}
return dp[S.length()-1][T.length()-1];
}maximal rectangle （o(m*n*n)
把每一行一刀切了，当作矩阵的底面，然后保存它上面最多有几个连着的1，这样跑一遍整个矩阵得到res[][]
然后对矩阵里的每个位置进行左右的expand，知道宽度变窄（就是以此为最高以此为底的矩阵），update最大值 （这一步要o(m*n*n)）
（其实还有优化 就是用stack来做每一层的面积（largest histogram area）会是 m*n)
public int maximalRectangle(char[][] rec) {
int max = 0;
if (rec.length==0 || rec[0].length==0) return 0;
int[][] res = new int[rec.length][rec[0].length];
for (int j=0;j<rec[0].length;j++) {
res[0][j]=(rec[0][j] - '0');
}
for (int i=1;i<rec.length;i++) {
for (int j=0;j<rec[0].length;j++) {
res[i][j]=rec[i][j]=='1'? (res[i-1][j]+1) : 0;
}
}
for (int i=0;i<rec.length;i++) {
for (int j=0;j<rec[0].length;j++) {
if (res[i][j]!=0) {
int l = j;
int r = j;
while (l>0 || r<rec[0].length-1) {
boolean done = true;
if (l>0 && res[i][l-1]>=res[i][j]) {
l--;
done = false;
}
if (r<rec[0].length-1 && res[i][r+1]>=res[i][j]) {
r++;
done = false;
}
if (done) break;
}
int min = r-l+1;
max = Math.max(max, min*res[i][j]);
}
}
}
return max;
}
1. 取每个i作为最高高度来expand (while loop, 然后记得skip掉height[i]==height[i+1]的
2. 穷举两个边界，但不是完全穷举，这里可以省掉一部分右右边界。对于i，如果A[i] <= A[i + 1]，即当前递增，则无论对于哪个左边界，选i+1作为右边界都比选i作为右边界合适（宽本来就多一个，然后高还更高，所以肯定选右边的面积大）。所以就算i+1作为右边界的所有左边界配对就行，没必要算i作为右边界的了。所以递推下去，只有A[i] > A[i + 1]的时候，在递减，说明拿A[i]和拿A[i + 1]不一定谁大了，这时候算一下A[i]作为右边界的左边界所有可能，就是一个local peak。这题还有一个O(n)的解法，但是暂时懒的看了。下次再看。
public int largestRectangleArea(int[] height) {
int res = 0;
for (int i = height.length - 1; i >= 0; i--) {
if (i == height.length - 1 || height[i] > height[i + 1]) { //A[i] is a local peak
int min = Integer.MAX_VALUE;
for (int j = i; j >= 0; j--) {
min = Math.min(min, height[j]);
res = Math.max(res, (i - j + 1) * min);
}
}
}
return res;
}
candy
左边扫一遍保证他们拿的比左边的多
右边扫一遍保证他们拿的比右边的多
public int candy(int[] ratings) {
if (ratings.length==0) return 0;
int[] dp = new int[ratings.length];
int res = 0;
dp[0]=1;
for (int i=1; i<dp.length;i++) {
if (ratings[i]>ratings[i-1]) dp[i]=dp[i-1]+1;
else dp[i]=1;
}
int[] dp2 = new int[ratings.length];
dp2[dp2.length-1] = 1;
for (int i=dp2.length-1;i>=0;i--) {
if (i!=dp2.length-1 && ratings[i]>ratings[i+1]) {
dp2[i]=dp2[i+1]+1;
} else dp2[i]=1;
res += Math.max(dp[i],dp2[i]);
}
return res;
}
扫一扫
791
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
