dynamic-programming-and-optimal-control
文章平均质量分 50
Ulricalin
这个作者很懒,什么都没留下…
展开
-
638. Shopping Offers
In LeetCode Store, there are some kinds of items to sell. Each item has a price.However, there are some special offers, and a special offer consists of one or more different kinds of items with a sale原创 2017-10-31 22:31:40 · 253 阅读 · 0 评论 -
474. Ones and Zeroes
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the other han原创 2017-11-06 16:02:07 · 278 阅读 · 0 评论 -
718. Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.Example 1:Input:A: [1,2,3,2,1]B: [3,2,1,4,7]Output: 3Explanation: The repeated subarray with原创 2017-11-16 20:09:40 · 231 阅读 · 0 评论 -
647. Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist of原创 2017-12-01 21:43:00 · 239 阅读 · 0 评论 -
673. Number of Longest Increasing Subsequence
Given an unsorted array of integers, find the number of longest increasing subsequence.Example 1:Input: [1,3,5,4,7]Output: 2Explanation: The two longest increasing subsequence are [1, 3, 4, 7] and [1原创 2017-11-22 22:10:53 · 204 阅读 · 0 评论 -
516. 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:4One possible longest palindromic subseque原创 2017-12-02 17:02:20 · 316 阅读 · 0 评论