leetcode总结
文章平均质量分 52
傻月菇凉
这个作者很懒,什么都没留下…
展开
-
binary-tree-preorder-traversal(二叉树前序遍历)
题目描述Given a binary tree, return the preorder traversal of its nodes’ values.For example:Given binary tree{1,#,2,3},return[1,2,3].Recursive solution is trivial, could you do it iteratively?翻译:给定二...原创 2018-08-22 17:06:52 · 2030 阅读 · 0 评论 -
binary-tree-postorder-traversal(二叉树后序遍历)
题目描述Given a binary tree, return the postorder traversal of its nodes’ values.For example:Given binary tree{1,#,2,3},return[3,2,1].Note: Recursive solution is trivial, could you do it iteratively?...原创 2018-08-22 17:20:35 · 430 阅读 · 0 评论 -
reorder-list(重排链表)
问题描述Given a singly linked list L: L 0→L 1→…→L n-1→L nreorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…You must do this in-place without altering the nodes’ valuesFor example,Given{1,2,3,4}, reorder ...原创 2018-08-22 17:59:51 · 349 阅读 · 0 评论 -
linked-list-cycle-ii
题目描述Given a linked list, return the node where the cycle begins. If there is no cycle, return null.翻译:给定链表,返回循环开始的节点。 如果没有循环,则返回null。分析先使用快慢指针,确定链表是否存在环,并且确定快指针和慢指针相等的节点。利用一个指针从头节点开始向后移动,慢指...原创 2018-08-23 20:59:28 · 376 阅读 · 0 评论 -
sum-root-to-left-numbers
题目简述Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which represents the number123.Find the total ...原创 2018-08-24 11:18:29 · 198 阅读 · 0 评论 -
longest-consecutive-sequence
问题简述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 longest consecutive elements sequence is[1, 2, 3, ...原创 2018-08-24 11:59:53 · 1046 阅读 · 0 评论 -
word-ladder
问题描述Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a time Each intermediate ...原创 2018-08-24 16:38:00 · 195 阅读 · 0 评论