2015年3月19日
leetcode------Path Sum II
摘要： 标题：Path Sum II通过率：26.7%难度：中等Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given th... 阅读全文
posted @ 2015-03-19 16:26 pku_smile 阅读(142) 评论(0) 推荐(0)
leetcode------Sum Root to Leaf Numbers
摘要： 标题：Sum Root to Leaf Numbers通过率：30.4%难度：中等Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example... 阅读全文
posted @ 2015-03-19 16:23 pku_smile 阅读(140) 评论(0) 推荐(0)
leetcode------Word Search
摘要： 标题：Word Search通过率：20.0%难度：中等Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially ... 阅读全文
posted @ 2015-03-19 11:37 pku_smile 阅读(155) 评论(0) 推荐(0)