随笔分类 -  LeetCode

LeetCode-Minimum Path Sum[dp]
摘要：Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers 阅读全文
posted @ 2017-07-11 16:02 Little_Lu 阅读(121) 评论(0) 推荐(0)
LeetCode-Interleaving String[dp]
摘要：Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example,Given:s1 = "aabcc",s2 = "dbbca", When s3 阅读全文
posted @ 2017-07-11 14:58 Little_Lu 阅读(126) 评论(0) 推荐(0)
LeetCode-Best Time to Buy and Sell Stock III[dp]
摘要：Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2017-07-11 10:23 Little_Lu 阅读(172) 评论(0) 推荐(0)
LeetCode-Palindrome Partitioning II[dp]
摘要：Palindrome Partitioning II Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed fo 阅读全文
posted @ 2017-07-09 17:01 Little_Lu 阅读(143) 评论(0) 推荐(0)
LeetCode-Maximum Subarray[dp]
摘要：Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array 阅读全文
posted @ 2017-07-09 15:46 Little_Lu 阅读(245) 评论(0) 推荐(0)
LeetCode-Triangle[dp]
摘要：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 fo 阅读全文
posted @ 2017-07-09 10:53 Little_Lu 阅读(235) 评论(0) 推荐(0)