2015年3月19日

LeetCode-139 Word Break

摘要: Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文

posted @ 2015-03-19 18:17 linxiong1991 阅读(93) 评论(0) 推荐(0) 编辑

LeetCode-124 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 @ 2015-03-19 12:06 linxiong1991 阅读(150) 评论(0) 推荐(0) 编辑

导航