![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Distinct Subsequences
class Solution {public: int numDistinct(string S, string T) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = T.size(); int n原创 2013-01-23 16:32:38 · 634 阅读 · 0 评论 -
[LeetCode] Binary Tree Maximum Path Sum
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti原创 2013-01-28 19:36:48 · 364 阅读 · 0 评论 -
[LeetCode] Longest Palindromic Substring
class Solution {public: string longestPalindrome(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int len = s.length(); in原创 2013-01-29 15:24:22 · 461 阅读 · 0 评论 -
[LeetCode] Scramble String
class Solution {public: bool isScramble(string s1, string s2) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = s1.size();原创 2013-01-29 00:28:23 · 460 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock III
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = prices.size(); if (n原创 2013-01-28 19:47:43 · 302 阅读 · 0 评论 -
[LeetCode] Trapping Rain Water
class Solution {public: int trap(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector left(n); vector right(n);原创 2013-01-28 14:52:32 · 494 阅读 · 0 评论 -
[LeetCode] Climbing Stairs
class Solution {public: int climbStairs(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector dp(n + 1); dp[0] = 1;原创 2013-01-27 19:30:53 · 257 阅读 · 0 评论 -
[LeetCode] Maximum Subarray
class Solution {public: int maxSubArray(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int ret = A[0]; int sum = 0原创 2013-01-28 14:45:34 · 382 阅读 · 0 评论 -
[LeetCode] Unique Paths II
class Solution {public: int uniquePathsWithObstacles(vector > &obstacleGrid) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = obstac原创 2013-01-27 21:08:43 · 386 阅读 · 0 评论 -
[LeetCode] Unique Paths
class Solution {public: int uniquePaths(int m, int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > dp(m, vector(n));原创 2013-01-27 21:03:23 · 353 阅读 · 0 评论 -
[LeetCode] Minimum Path Sum
class Solution {public: int minPathSum(vector > &grid) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = grid.size(); if (m =原创 2013-01-27 20:58:52 · 369 阅读 · 0 评论 -
[LeetCode] Edit Distance
class Solution {public: int minDistance(string word1, string word2) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = word1.size();原创 2013-01-27 18:56:48 · 362 阅读 · 0 评论 -
[LeetCode] Interleaving String
class Solution {public: bool isInterleave(string s1, string s2, string s3) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = s1.s原创 2013-01-24 18:35:36 · 387 阅读 · 0 评论 -
[LeetCode] Unique Binary Search Tree
class Solution {public: int numTrees(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector dp(n + 1); dp[原创 2013-01-24 18:47:20 · 354 阅读 · 0 评论 -
[LeetCode] Triangle
class Solution {public: int minimumTotal(vector > &triangle) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = triangle.size();原创 2013-01-29 00:29:36 · 447 阅读 · 0 评论