Belle_Chou的博客

Solution 1:二维的dp 时间复杂度：0（mn） 空间复杂度：0（mn） class Solution { public int uniquePaths(int m, int n) { int [][] dp = new int[n][m]; for(int i = 0; i < m ;i++){ dp[0][i] = ...

Solution: dp 同62题。一行一行向下扫 class Solution { public int uniquePathsWithObstacles(int[][] obstacleGrid) { int m = obstacleGrid.length; int n = obstacleGrid[0].length; int[] dp...

自己写的 时间复杂度差 class Solution { public int numSquares(int n) { int [] dp = new int[n+1]; Arrays.fill(dp, Integer.MAX_VALUE); for(int i = 1 ;i <= n ;i++){ ...

class Solution { public boolean isInterleave(String s1, String s2, String s3) { int m = s1.length() + 1; int n = s2.length() + 1; if(m + n - 2 != s3.length()) return false;...

public int maxProfit(int k, int[] prices) { int len = prices.length; if (k >= len / 2) return quickSolve(prices); int[][] t = new int[k + 1][len]; for (int ...

Solution 1: O(n) dp dp初始化，为空的时候也有一种编码方式，所以dp【0】= 1； “0” 没有编码方式 class Solution { public int numDecodings(String s) { if(s == null || s.length() == 0) return 0; int len = s.length();...