动态规划
文章平均质量分 57
路漫远吾求索
电子,无线局域网
展开
-
Leetcode——276.Paint Fence
DescriptionThere is a fence with n posts, each post can be painted with one of the k colors.You have to paint all the posts such that no more than two adjacent fence posts have the same color.Return th原创 2017-02-21 16:01:19 · 1055 阅读 · 0 评论 -
文章标题
DescriptionThere are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint原创 2017-02-21 16:23:24 · 237 阅读 · 0 评论 -
Leetcode——198. House Robber
Descriptionhttps://leetcode.com/problems/house-robber/?tab=Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only c原创 2017-02-21 16:57:42 · 287 阅读 · 0 评论 -
Leetcode——486. Predict the Winner
https://leetcode.com/problems/predict-the-winner/?tab=DescriptionDescriptionGiven an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array follo原创 2017-03-06 22:35:40 · 3161 阅读 · 0 评论 -
Leetcode——516. Longest Palindromic Subsequence
DescriptionGiven 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 palindro原创 2017-03-06 23:56:17 · 527 阅读 · 0 评论 -
Leetcode——91. Decode Ways
#https://leetcode.com/problems/decode-ways/?tab=Solutions A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encod原创 2017-03-10 23:53:40 · 332 阅读 · 0 评论 -
Leetcode——523. Continuous Subarray Sum
Description Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is,原创 2017-03-11 18:46:47 · 323 阅读 · 0 评论 -
Leetcode——501. Find Mode in Binary Search Tree
#https://leetcode.com/problems/find-mode-in-binary-search-tree/?tab=Solutions Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given原创 2017-03-11 19:26:45 · 462 阅读 · 0 评论 -
求数组中最长递增子序列,数组分割,数组循环移位,区间重合判断
求数组中最长递增子序列编程之美2.16 注意,所谓的递增子序列不一定是连续的 只要满足递增性即可。 方法:动态规划思想。 用dp[i]表示到i为止,最长的递增序列长度。(可能包含i,也可能不包含i) 那么dp[i+1]就是判断A[i+1]能否加上,即 dp[i+1]=max(dp[0~i]+A[0~i]int calculong(int *A, int n){ int *dp原创 2017-03-31 22:45:22 · 504 阅读 · 0 评论