2016年4月18日
Interleaving String (DP)
摘要： 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", re 阅读全文
posted @ 2016-04-18 19:43 YuriFLAG 阅读(167) 评论(0) 推荐(0)
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 @ 2016-04-18 09:02 YuriFLAG 阅读(180) 评论(0) 推荐(0)
Longest Common Subsequence (DP)
摘要： Given two strings, find the longest common subsequence (LCS). Your code should return the length of LCS. Example For "ABCD" and "EDCA", the LCS is "A" 阅读全文
posted @ 2016-04-18 08:27 YuriFLAG 阅读(285) 评论(0) 推荐(0)