标签：动态规划

2017-06-22xindoo阅读(5069)评论(0)赞(0)

题目链接 Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of...

2017-02-25xindoo阅读(4603)评论(0)赞(0)

好久没刷题了，今天来俩道简单题。 Leetcode 62. Unique Paths Leetcode 63. Unique Paths II ~谢谢打赏~ 赏

2016-08-07xindoo阅读(4721)评论(0)赞(0)

题目链接：53.Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the lar...

2016-07-27xindoo阅读(4651)评论(0)赞(0)

题目链接：Combination Sum IV Given an integer array with all positive numbers and no duplicates, find the number of possible ...

2016-05-09xindoo阅读(4571)评论(0)赞(0)

原题链接：198. House Robber 　　一句话理解题意，有个偷马贼晚上要偷尽可能值钱的马，但连续两头马被偷会触发报警，问他如何在不触发报警（不偷连续的两匹马）的情况下偷到总价值最高马，返回最高总价值。 　　看到maximu...