【动态规划】
文章平均质量分 58
残阳摧雪
行有不得,反求诸己!
展开
-
70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive inte原创 2017-08-20 15:37:38 · 191 阅读 · 0 评论 -
动态规划
未完待续。。。 未完待续。。。原创 2017-08-20 15:17:57 · 173 阅读 · 0 评论 -
120. Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7],原创 2017-08-20 17:20:32 · 179 阅读 · 0 评论 -
343. Integer Break
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, given n = 2, return 1原创 2017-08-20 19:21:36 · 170 阅读 · 0 评论 -
279. Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return原创 2017-08-20 20:10:48 · 190 阅读 · 0 评论 -
198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses原创 2017-08-21 11:35:40 · 247 阅读 · 0 评论 -
91. Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26Given an encoded message containing digits, determine the total number of w原创 2017-08-21 14:07:39 · 191 阅读 · 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 element wi原创 2017-08-23 11:18:52 · 199 阅读 · 0 评论 -
0-1背包问题
状态 &转移状态:f(i,C)f(i,C)表示考虑将[0..i]的背包放入容量为C的背包的最大价值 状态转移: f(i,C)=max{f(i−1,C),v[i]+f(i−1,C)} f(i,C)=\max \{f(i-1,C),v[i]+f(i-1,C) \} 解题代码class Solution {private: vector<vector<int>> memo; // [0原创 2017-08-23 10:57:09 · 232 阅读 · 0 评论