![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dynamic programming
文章平均质量分 61
Evolraelc
这个作者很懒,什么都没留下…
展开
-
413. Arithmetic Slices(第九周)
Description:A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are原创 2017-04-23 20:04:26 · 308 阅读 · 0 评论 -
357. Count Numbers with Unique Digits(第十二周)
Description:Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0原创 2017-05-14 22:33:18 · 207 阅读 · 0 评论 -
494. Target Sum(第十一周)
Description:You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new s原创 2017-05-07 19:37:50 · 268 阅读 · 0 评论 -
343. Integer Break(第十四周)
Description:Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example原创 2017-05-29 00:06:47 · 299 阅读 · 0 评论 -
Add to List 474. Ones and Zeroes(第十五周)
Description: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 respect原创 2017-06-04 22:16:17 · 288 阅读 · 0 评论 -
376. Wiggle Subsequence(第十三周)
Description:A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists)原创 2017-05-21 23:35:26 · 238 阅读 · 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 palind原创 2017-06-18 21:30:55 · 371 阅读 · 0 评论 -
416. Partition Equal Subset Sum(第十六周)
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each of the array原创 2017-06-12 00:20:21 · 250 阅读 · 0 评论