Leetcode - 随笔分类(第15页) - amazingzoe

Construct Binary Tree From Preorder and Inorder Traversal **

摘要：Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Analyse: We can... 阅读全文

posted @ 2015-07-29 20:22 amazingzoe 阅读(212) 评论(0) 推荐(0)

Populating Next Right Pointers in Each Node II

摘要：Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文

posted @ 2015-07-28 17:56 amazingzoe 阅读(152) 评论(0) 推荐(0)

Populating Next Right Pointers in Each Node

摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文

posted @ 2015-07-28 17:29 amazingzoe 阅读(145) 评论(0) 推荐(0)

Flatten Binary Tree to Linked List

摘要：Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文

posted @ 2015-07-28 17:07 amazingzoe 阅读(112) 评论(0) 推荐(0)

Balanced Binary Tree

摘要：Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth... 阅读全文

posted @ 2015-07-28 16:11 amazingzoe 阅读(103) 评论(0) 推荐(0)

Symmetric Tree

摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文

posted @ 2015-07-28 13:29 amazingzoe 阅读(159) 评论(0) 推荐(0)

Same Tree

摘要：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文

posted @ 2015-07-28 13:07 amazingzoe 阅读(126) 评论(0) 推荐(0)

Recover Binary Search Tree

摘要：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ... 阅读全文

posted @ 2015-07-28 12:54 amazingzoe 阅读(153) 评论(0) 推荐(0)

Binary Tree Zigzag Level Traversal

摘要：Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文

posted @ 2015-07-28 10:41 amazingzoe 阅读(183) 评论(0) 推荐(0)

Binary Tree Level Order Traversal II

摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文

posted @ 2015-07-27 22:34 amazingzoe 阅读(128) 评论(0) 推荐(0)

Binary Tree Level Order Traversal

摘要：Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文

posted @ 2015-07-27 22:00 amazingzoe 阅读(215) 评论(0) 推荐(0)

Binary Tree Postorder Traversal ***

摘要：Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文

posted @ 2015-07-27 16:17 amazingzoe 阅读(148) 评论(0) 推荐(0)

Binary Tree Inorder Traversal

摘要：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文

posted @ 2015-07-27 13:25 amazingzoe 阅读(129) 评论(0) 推荐(0)

Binary Tree Preorder Traversal

摘要：Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not... 阅读全文

posted @ 2015-07-27 12:05 amazingzoe 阅读(128) 评论(0) 推荐(0)

Combination Sum

摘要：Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文

posted @ 2015-07-26 18:50 amazingzoe 阅读(130) 评论(0) 推荐(0)

Unique Path II

摘要：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文

posted @ 2015-07-26 12:11 amazingzoe 阅读(150) 评论(0) 推荐(0)

Unique Path

摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文

posted @ 2015-07-26 11:44 amazingzoe 阅读(169) 评论(0) 推荐(0)

Subsets

摘要：Subsets I:Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution se... 阅读全文

posted @ 2015-07-25 09:02 amazingzoe 阅读(155) 评论(0) 推荐(0)

Search a 2D Matrix II

摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted in asc... 阅读全文

posted @ 2015-07-24 11:20 amazingzoe 阅读(139) 评论(0) 推荐(0)

Search a 2D Matrix

摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文

posted @ 2015-07-24 10:47 amazingzoe 阅读(120) 评论(0) 推荐(0)

随笔分类 - Leetcode

公告