dynamic programming
文章平均质量分 68
yoohoosome
这个作者很懒,什么都没留下…
展开
-
[刷题]Climbing Stairs
[LintCode]Climbing Stairs public class Solution { /** * @param n: An integer * @return: An integer */ public int climbStairs(int n) { // 2015-05-14 if (n ==原创 2015-05-14 22:26:07 · 290 阅读 · 1 评论 -
[刷题]Backpack II
[LintCode]Backpack II 标准的0-1背包问题。 public class Solution { /** * @param m: An integer m denotes the size of a backpack * @param A & V: Given n items with size A[i] and value V[i]原创 2015-05-21 21:26:10 · 351 阅读 · 1 评论 -
[刷题]Backpack
[LintCode]Backpack 此题为0-1背包问题的变体。 第一版是背包问题的常规思路,方法是可行的,但是会Memory Limit Exceeded。 第二版是常规思路的改进版,巧妙地将矩阵的元素类型从int改为boolean,以降低对空间的要求。 Version 1 Memory Limit Exceeded public class Solution {原创 2015-05-21 20:57:01 · 447 阅读 · 0 评论 -
[刷题]Maximum Subarray II
[LintCode]Maximum Subarray II public class Solution { /** * @param nums: A list of integers * @return: An integer denotes the sum of max two non-overlapping subarrays */ public原创 2016-04-06 09:52:16 · 415 阅读 · 0 评论 -
[刷题]Jump Game
[LintCode]Jump Game public class Solution { /** * @param A: A list of integers * @return: The boolean answer */ public boolean canJump(int[] A) { // 2015-05-15原创 2015-05-15 22:42:04 · 297 阅读 · 1 评论 -
[刷题]Distinct Subsequences
[LintCode]Distinct Subsequences public class Solution { /** * @param S, T: Two string. * @return: Count the number of distinct subsequences */ public int numDistinct(String S,原创 2015-05-24 22:42:31 · 404 阅读 · 0 评论 -
[刷题]k Sum
[LintCode]k Sum public class Solution { /** * @param A: an integer array. * @param k: a positive integer (k <= length(A)) * @param target: a integer * @return an integer原创 2015-05-23 22:55:33 · 319 阅读 · 0 评论 -
[刷题]Edit Distance
[LintCode]Edit Distance public class Solution { /** * @param word1 & word2: Two string. * @return: The minimum number of steps. */ public int minDistance(String word1, String原创 2015-05-20 18:01:11 · 329 阅读 · 0 评论 -
[刷题]Longest Common Subsequence
[LintCode]Longest Common Subsequence public class Solution { /** * @param A, B: Two strings. * @return: The length of longest common subsequence of A and B. */ public int l原创 2015-05-19 22:08:50 · 315 阅读 · 1 评论 -
[刷题]Minimum Adjustment Cost
[LintCode]Minimum Adjustment Cost public class Solution { /** * @param A: An integer array. * @param target: An integer. */ public int MinAdjustmentCost(ArrayList A, int targ原创 2015-05-23 22:56:28 · 1096 阅读 · 0 评论 -
[刷题]Word Break
[LintCode]Word Break public class Solution { /** * @param s: A string s * @param dict: A dictionary of words dict */ public boolean wordSegmentation(String s, Set dict) {原创 2015-05-18 18:55:19 · 265 阅读 · 1 评论 -
[刷题]Jump Game II
[LintCode]Jump Game II public class Solution { /** * @param A: A list of lists of integers * @return: An integer */ public int jump(int[] A) { // 2015-05-15 if原创 2015-05-15 22:42:28 · 281 阅读 · 1 评论 -
[刷题] Interleaving String
[LintCode]Interleaving String public class Solution { /** * Determine whether s3 is formed by interleaving of s1 and s2. * @param s1, s2, s3: As description. * @return: true or f原创 2015-05-26 09:32:36 · 335 阅读 · 0 评论 -
[刷题]Longest Increasing Subsequence
[LintCode]Longest Increasing Subsequence 此题并非一道标准的dp。尽管大问题的结果依赖小问题的结果(dp的思路),但该问题的最终输出不是最大的问题的结果,而是所有问题中某一个问题的结果(就本题来看,要求值最大)。这一点值得注意。lis[i]的含义为:以nums[i]为结尾的最大递增子序列的元素个数。本题最后输出为最大递增子序列的元素数,既lis数组中值原创 2015-05-18 19:15:15 · 315 阅读 · 1 评论 -
[刷题]Triangle
[LIntCode]Triangle public class Solution { /** * @param triangle: a list of lists of integers. * @return: An integer, minimum path sum. */ public int minimumTotal(ArrayList> tr原创 2015-05-13 21:45:56 · 263 阅读 · 1 评论 -
[刷题]Unique Paths
[LintCode]Unique Paths public class Solution { /** * @param n, m: positive integer (1 <= n ,m <= 100) * @return an integer */ public int uniquePaths(int m, int n) { //原创 2015-05-14 09:30:29 · 274 阅读 · 1 评论 -
[刷题]Unique Paths II
[LintCode]Unique Paths II public class Solution { /** * @param obstacleGrid: A list of lists of integers * @return: An integer */ public int uniquePathsWithObstacles(int[][]原创 2015-05-14 11:23:22 · 250 阅读 · 1 评论 -
[刷题]Minimum Path Sum
[LintCode]Minimum Path Sum public class Solution { /** * @param grid: a list of lists of integers. * @return: An integer, minimizes the sum of all numbers along its path */ pub原创 2015-05-13 22:16:11 · 269 阅读 · 1 评论 -
[刷题]Longest Common Substring
[LintCode]Longest Common Substring public class Solution { /** * @param A, B: Two string. * @return: the length of the longest common substring. */ public int longestCommonSubs原创 2015-05-19 22:23:59 · 383 阅读 · 0 评论