2014年11月30日
[Leetcode] Binary Tree Maximum Path Sum
摘要： Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-11-30 16:24 Phoebe815 阅读(140) 评论(0) 推荐(0) 编辑
[Leetcode] Set Matrix Zeroes
摘要： Given amxnmatrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A s... 阅读全文
posted @ 2014-11-30 09:24 Phoebe815 阅读(148) 评论(0) 推荐(0) 编辑
[Leetcode] Longest Valid Parentheses
摘要： Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文
posted @ 2014-11-30 08:41 Phoebe815 阅读(162) 评论(0) 推荐(0) 编辑
[Leetcode] Interleaving String
摘要： Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="... 阅读全文
posted @ 2014-11-30 03:47 Phoebe815 阅读(186) 评论(0) 推荐(0) 编辑