| | | | |

2016年11月6日

leetcode 129. Sum Root to Leaf Numbers ----- java

摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文

posted @ 2016-11-06 20:11 xiaoba1203 阅读(104) 评论(0) 推荐(0) 编辑

leetcode 128. Longest Consecutive Sequence ----- java

摘要： Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example,Given [100, 4, 200, 1, 3, 2],The longes 阅读全文

posted @ 2016-11-06 19:58 xiaoba1203 阅读(227) 评论(0) 推荐(0) 编辑

leetcode 127. Word Ladder ----- java

摘要： Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文

posted @ 2016-11-06 18:35 xiaoba1203 阅读(252) 评论(0) 推荐(0) 编辑

leetcode 126. Word Ladder II ----- java

摘要： Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such th 阅读全文

posted @ 2016-11-06 17:53 xiaoba1203 阅读(345) 评论(0) 推荐(0) 编辑

2016年11月6日

公告