lintcode 算法学习__动态规划
呆呆侠
这个作者很懒,什么都没留下…
展开
-
lintcode114不同路径(动态规划easy)
public class Solution { /** * @param n, m: positive integer (1 <= n ,m <= 100) * @return an integer */ public int uniquePaths(int m, int n) { if(m==0||n==0){原创 2017-02-20 19:29:34 · 429 阅读 · 0 评论 -
lintcode77最长公共子序列(动态规划medium)
public class Solution { /** * @param A, B: Two strings. * @return: The length of longest common subsequence of A and B. */ public int longestCommonSubsequence(String A, String B)原创 2017-03-05 16:09:36 · 272 阅读 · 0 评论 -
trapping_rain_water
package Week1_DP;public class trapping_rain_water { /** * @param args */ public static void main(String[] args) { int[] arr={3,0,0,0,0,3}; int s=method(arr); Sy原创 2017-03-07 18:57:00 · 243 阅读 · 0 评论 -
lintcode110最小路径和(动态规划easy)
public class Solution { /** * @param grid: a list of lists of integers. * @return: An integer, minimizes the sum of all numbers along its path */ public int minPathSum(int[][] gr原创 2017-02-20 21:20:26 · 897 阅读 · 0 评论 -
lintcode514栅栏染色(动态规划easy)
方法一public class Solution { /** * @param n non-negative integer, n posts * @param k non-negative integer, k colors * @return an integer, the total number of ways */ public i原创 2017-02-21 19:26:58 · 684 阅读 · 0 评论 -
lintcode397最长上升连续子序列(动态规划easy)
public class Solution { /** * @param A an array of Integer * @return an integer */ public int longestIncreasingContinuousSubsequence(int[] A) { int n=A.length; i原创 2017-02-21 16:47:56 · 485 阅读 · 0 评论 -
lintcode394硬币排成线(动态规划medium)
public class Solution { /** * @param n: an integer * @return: a boolean which equals to true if the first player will win */ public boolean firstWillWin(int n) { if(n%3==原创 2017-03-01 20:03:00 · 669 阅读 · 0 评论 -
lintcode115不同路径问题(二)(动态规划easy)
public class Solution { /** * @param obstacleGrid: A list of lists of integers * @return: An integer */ public int uniquePathsWithObstacles(int[][] obstacleGrid) { int m=原创 2017-02-20 21:04:36 · 442 阅读 · 0 评论 -
lintcode111爬楼梯问题(动态规划easy)
题目:假设你正在爬楼梯,需要n步你才能到达顶部。但每次你只能爬一步或者两步,你能有多少种不同的方法爬到楼顶部?解决代码:public class Solution { /** * @param n: An integer * @return: An integer */ public int climbStairs(int n) {原创 2017-02-20 17:28:20 · 1980 阅读 · 0 评论 -
待改正
public class Solution { /** * @param triangle: a list of lists of integers. * @return: An integer, minimum path sum. */ public int minimumTotal(int[][] triangle) { int n=原创 2017-02-26 16:52:51 · 300 阅读 · 0 评论