动态规划
JohnWill_
小白一个,慢慢成长....
展开
-
Palindrome Partitioning II 基于动态规划DP
题目描述Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s ="aab",Return1since ...原创 2018-03-23 09:24:31 · 218 阅读 · 0 评论 -
Edit Distance
概念编辑距离的作用主要是用来比较两个字符串的相似度的基本的定义如下所示:编辑距离,又称Levenshtein距离(莱文斯坦距离也叫做Edit Distance),是指两个字串之间,由一个转成另一个所需的最少编辑操作次数,如果它们的距离越大,说明它们越是不同。许可的编辑操作包括将一个字符替换成另一个字符,插入一个字符,删除一个字符。这个概念是由俄罗斯科学家Vladimir Levenshtein在1...原创 2018-04-07 12:11:56 · 117 阅读 · 0 评论 -
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 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", return false.【解析】...原创 2018-03-29 15:01:36 · 157 阅读 · 0 评论 -
Candy小孩分糖果问题
题目:There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one can...原创 2018-03-22 11:26:25 · 930 阅读 · 0 评论 -
Unique Paths II
题目:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.Fo...原创 2018-04-08 20:30:42 · 76 阅读 · 0 评论 -
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], ...原创 2018-03-26 10:06:51 · 296 阅读 · 0 评论 -
Unique Paths
题目描述A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach...原创 2018-04-08 15:02:33 · 85 阅读 · 0 评论 -
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 along its path. Note: You can only move either down or right...原创 2018-04-08 14:27:13 · 151 阅读 · 0 评论 -
decode-ways
题目描述A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the...原创 2018-03-30 22:44:55 · 193 阅读 · 0 评论 -
动态规划Word Break 2
题目:Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens ="catsandd...原创 2018-03-21 10:27:06 · 346 阅读 · 0 评论 -
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? 1、具有最优子结构,如果最优解中包含了子问题的最优解...原创 2018-04-07 14:48:25 · 86 阅读 · 0 评论 -
动态规划Word Break
题目:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens ="leetcode",dict =["leet", "code...原创 2018-03-20 21:15:11 · 218 阅读 · 0 评论 -
Longest Palindromic Substring
题目描述Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 时间复杂度为O(N²)的算法-动态规...原创 2018-04-20 14:06:36 · 121 阅读 · 0 评论