leetcode
liqinzhe223
这个作者很懒,什么都没留下…
展开
-
leetcode 102. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 2原创 2017-09-13 14:49:41 · 246 阅读 · 0 评论 -
leetcode 111. Minimum Depth of Binary Tree
找树的最小深度。两种方法:1、递归2、BFSclass Solution {public: int minDepth(TreeNode* root) { //way-1 /* int mindeep; if(!root) return 0; else原创 2017-09-13 15:02:01 · 168 阅读 · 0 评论 -
leetcode 130. Surrounded Regions
Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X原创 2017-09-13 15:08:23 · 203 阅读 · 0 评论 -
leetcode 133. Clone Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for ea原创 2017-09-13 15:13:20 · 172 阅读 · 0 评论 -
leetcode 199. Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary tree, 1原创 2017-09-13 15:30:13 · 188 阅读 · 0 评论 -
leetcode 126. Word Ladder II
Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a timeEac原创 2017-09-13 15:49:11 · 210 阅读 · 0 评论 -
leetcode 207. Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a原创 2017-09-13 15:35:54 · 137 阅读 · 0 评论 -
leetcode 210. Course Schedule II
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a原创 2017-09-13 15:43:30 · 183 阅读 · 0 评论 -
leetcode 98. Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th原创 2017-09-14 09:57:22 · 145 阅读 · 0 评论 -
leetcode 99. 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 pretty straight forward. 中序遍历二叉树,出现的节点的值原创 2017-09-14 10:21:20 · 202 阅读 · 0 评论 -
leetcode 100. 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 and the nodes have the same value./**原创 2017-09-14 10:26:41 · 178 阅读 · 0 评论 -
leetcode 104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.递归/** * Definition for原创 2017-09-14 10:34:38 · 210 阅读 · 0 评论 -
leetcode 105. 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./** * Definition for a binary tree node. * stru原创 2017-09-14 10:58:26 · 159 阅读 · 0 评论 -
leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.后序遍历的最后一个是根节点,将中序遍历分开成左右子树。/** * Definition for a原创 2017-09-14 11:04:00 · 157 阅读 · 0 评论 -
leetcode 124. Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The原创 2017-09-14 15:28:32 · 196 阅读 · 0 评论 -
leetcode 129. Sum Root to Leaf Numbers
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 which represents the number 123.Find the tota原创 2017-09-14 14:55:46 · 162 阅读 · 0 评论 -
leetcode 116/117 Populating Next Right Pointers in Each Node 1/2
116 and 117 同一份代码: 无论什么二叉树,都可以。不一定是完全二叉树 Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next po原创 2017-09-14 14:36:34 · 217 阅读 · 0 评论 -
leetcode 114. 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 6 一次基本操作:root为1,56移动到4下面,2移动到原本5的位置。root变为2原创 2017-09-14 14:31:45 · 128 阅读 · 0 评论 -
leetcode 110. 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 of the two subtrees of every node never diffe原创 2017-09-14 14:05:41 · 141 阅读 · 0 评论 -
leetcode 109. Convert Sorted List to Binary Search Tree
Given a singly linked listwhere elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for singly-linked list. * struct ListNode { * int val;原创 2017-09-14 11:24:04 · 174 阅读 · 0 评论 -
leetcode 108. Convert Sorted Array to Binary Search Tree
形成一个BST由于已经是排序后的数组,所以直接找到下标中间点就行。如果没有排序的情况,应该先排序。/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode原创 2017-09-14 11:16:51 · 198 阅读 · 0 评论 -
leetcode 128. 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 i原创 2017-09-20 11:07:41 · 236 阅读 · 0 评论 -
leetcode 547. Friend Circles
There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, the原创 2017-09-20 13:59:11 · 175 阅读 · 0 评论 -
leetcode 200. Number of Islands
/*Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may原创 2017-02-22 15:50:01 · 408 阅读 · 0 评论 -
leetcode 310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini原创 2017-09-22 14:41:44 · 180 阅读 · 0 评论 -
leetcode 31. Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possib原创 2017-10-27 10:23:01 · 139 阅读 · 0 评论 -
leetcode 33|81. Search in Rotated Sorted Array 1|2
33. Search in Rotated Sorted ArraySuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a t原创 2017-10-27 10:36:08 · 201 阅读 · 0 评论 -
leetcode 34. Search for a Range
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the targ原创 2017-10-27 10:54:12 · 158 阅读 · 0 评论 -
leetcode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the arra原创 2017-10-30 09:26:47 · 176 阅读 · 0 评论 -
leetcode 55|45. Jump Game 1|2
55. Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.原创 2017-10-30 10:05:51 · 173 阅读 · 0 评论 -
leetcode 48. Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the input 2D matrix d原创 2017-10-30 10:21:52 · 153 阅读 · 0 评论 -
leetcode 70. Climbing Stairs
70. Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: G原创 2017-11-08 09:38:25 · 123 阅读 · 0 评论 -
leetcode 20|22|32. Valid Parentheses 22. Generate Parentheses 32. Longest Valid Parentheses
20. Valid ParenthesesGiven a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()原创 2017-11-07 10:35:26 · 150 阅读 · 0 评论 -
leetcode 72. Edit Distance
72. Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operatio原创 2017-11-08 09:54:50 · 177 阅读 · 0 评论 -
leetcode 87. Scramble String
87. Scramble StringGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great":原创 2017-11-08 10:05:55 · 149 阅读 · 0 评论 -
leetcode 91. Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu原创 2017-11-08 10:30:48 · 125 阅读 · 0 评论 -
leetcode 96|95. Unique Binary Search Trees 1|2
96. Unique Binary Search TreesGiven n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1原创 2017-11-08 10:32:48 · 152 阅读 · 0 评论 -
leetcode 56. Merge Intervals 57. Insert Interval
56. Merge IntervalsGiven a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].方法一:先按照start位置排序,然后挨个比较与身后的原创 2017-10-31 09:41:00 · 224 阅读 · 0 评论 -
leetcode 11. Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two原创 2017-10-23 16:32:14 · 163 阅读 · 0 评论 -
leetcode 97. Interleaving String
97. Interleaving StringGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.原创 2017-11-09 09:37:13 · 150 阅读 · 0 评论