- 博客(3)
- 收藏
- 关注
原创 十二周动态规划 Longest Palindromic Subsequence
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1: Input:"bbbab" Output: 4 One possible longest palindromic subsequ
2017-05-18 08:38:44 419
原创 十一周- Dynamic Programming- Coin Change
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money c
2017-05-18 08:35:09 552
原创 第十周 动态规划 Combination Sum IV
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.Example:nums = [1, 2, 3] target = 4The possible com
2017-05-18 08:29:30 548
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人