Leetcode
baibaibai66
这个作者很懒,什么都没留下…
展开
-
96. Unique Binary Search Trees
QGiven 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.SCatalan数 参考:http://www.cnblogs.com/NickyYe/p/42原创 2017-01-23 07:50:43 · 237 阅读 · 0 评论 -
278. First Bad Version
ProblemYou are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based原创 2016-09-07 11:31:11 · 174 阅读 · 0 评论 -
88. Merge Sorted Array
TitleGiven two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additio原创 2016-08-14 18:34:40 · 215 阅读 · 0 评论 -
26. Remove Duplicates from Sorted Array
TitleGiven a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-08-14 15:39:53 · 157 阅读 · 0 评论 -
72. Edit Distance
ProblemGiven 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 operations permitted on a wor原创 2016-09-16 18:12:05 · 216 阅读 · 0 评论 -
70. Climbing Stairs
ProblemYou 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?Solution题目思路了很简单了:dp[i] = dp[i原创 2016-09-16 16:09:29 · 175 阅读 · 0 评论 -
34. Search for a Range
TitleGiven a sorted array of integers, 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 target is not found in t原创 2016-09-07 10:42:05 · 225 阅读 · 0 评论 -
35. Search Insert Position
这两天需要先去读一些RFC啥的,没空做了。TitleGiven 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 dup原创 2016-08-29 19:24:35 · 299 阅读 · 0 评论 -
260. Single Number III
TitleGiven an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given nums =原创 2016-09-04 10:32:45 · 203 阅读 · 0 评论 -
137. Single Number II
TitleGiven an array of integers, every element appears three times except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without usi原创 2016-09-04 09:44:48 · 184 阅读 · 0 评论 -
136. Single Number
TitleGiven an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using ext原创 2016-09-03 23:51:10 · 170 阅读 · 0 评论 -
27. Remove Element
TitleGiven an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The原创 2016-08-12 11:12:01 · 184 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
TitleThere are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3]n原创 2016-08-24 19:36:19 · 180 阅读 · 0 评论 -
374. Guess Number Higher or Lower
还是按照Similar Problems刷题更好些…ProblemWe are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I’ll tell you whe原创 2016-09-07 11:43:43 · 166 阅读 · 0 评论 -
63. Unique Paths II
ProblemFollow 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 is marked as 1 and 0 respectively in the grid原创 2016-09-08 10:15:23 · 149 阅读 · 0 评论 -
109. Convert Sorted List to Binary Search Tree
Qhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/?tab=Description Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.A原创 2017-02-09 12:55:40 · 669 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal
Qhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/Given preorder and inorder traversal of a tree, construct the binary tree.A”’c /** * Definition for a binary原创 2017-02-09 11:23:09 · 433 阅读 · 0 评论 -
106. Construct Binary Tree from Inorder and Postorder Traversal
Qhttps://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/Given inorder and postorder traversal of a tree, construct the binary tree.A/** * Definition for a binary tree原创 2017-02-09 11:24:10 · 371 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree
Qhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/Given an array where elements are sorted in ascending order, convert it to a height balanced BST.A/** * Definition for a binar原创 2017-02-09 11:21:34 · 325 阅读 · 0 评论 -
98. Validate Binary Search Tree
QGiven 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. The righ原创 2017-01-13 14:54:57 · 365 阅读 · 0 评论 -
113. Path Sum II
TGiven a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.S/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *l原创 2017-01-06 16:12:10 · 230 阅读 · 0 评论 -
112. Path Sum
TGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.S/** * Definition for a binary tree node. * struct原创 2017-01-06 15:43:45 · 270 阅读 · 0 评论 -
111. Minimum Depth of Binary Tree
TGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.S/** * Definition for a binary tree node.原创 2017-01-06 15:17:04 · 312 阅读 · 0 评论 -
100. Same Tree
TitleGiven 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.Solutions/**原创 2016-08-11 14:33:15 · 235 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree
TGiven 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.S/** * Definition for a binary tree node.原创 2017-01-05 14:29:35 · 317 阅读 · 0 评论 -
110. Balanced Binary Tree
TGiven 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 differ by原创 2017-01-06 14:33:41 · 252 阅读 · 0 评论 -
101. Symmetric Tree
QGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric:But the following [1,2,2,null,3,null,3] is not:原创 2017-01-04 14:47:48 · 253 阅读 · 0 评论 -
144. Binary Tree Preorder Traversal
TitleGiven a binary tree, return the preorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3},return [1,2,3].Note: Recursive solution is trivial, could you do it iteratively?So原创 2016-08-11 21:47:06 · 246 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal
TitleGiven a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree [1,null,2,3],return [1,3,2].Note: Recursive solution is trivial, could you do it iteratively?原创 2016-08-11 21:23:18 · 194 阅读 · 0 评论 -
120. Triangle
ProblemGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,原创 2016-09-14 09:19:12 · 189 阅读 · 0 评论 -
225. Implement Stack using Queues
TitleImplement the following operations of a stack using queues.push(x) – Push element x onto stack.pop() – Removes the element on top of the stack.top() – Get the top element.empty() – Return whet原创 2016-07-28 15:12:22 · 173 阅读 · 0 评论 -
20. Valid Parentheses(stack)
problem Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are原创 2016-06-27 17:29:22 · 380 阅读 · 0 评论 -
24. Swap Nodes in Pairs(Linked List)
TitleGiven a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You m原创 2016-05-22 09:27:44 · 254 阅读 · 0 评论 -
234. Palindrome (Linked List)
TitleGiven a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?Language C/** * Definition for singly-linked list. * struct ListNode { *原创 2016-05-22 09:14:23 · 251 阅读 · 0 评论 -
237. Delete Node in a (Linked List)
题目:Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3原创 2016-05-20 19:02:42 · 226 阅读 · 0 评论 -
2. Add Two Numbers(Linked List)
最近复习真的是曾经学过的链表,所以做了一下leetcodeLinked List的题目,做的都是简单题,还非得挂这里,我也只能说权当纪录一下,何况人家雁过还留声呢,不想再像以前一样走过却啥也未曾留下——记忆有时候也不怎么靠谱。题目:You are given two linked lists representing two non-negative numbers. The digits are原创 2016-05-20 18:54:16 · 438 阅读 · 0 评论 -
203. Remove Linked List Elements(Linked List)
为什么这么简单还贴出来,在 2. Add Two Numbers中,我已经解释了,不要问我有多菜……题目:Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3原创 2016-05-20 19:00:06 · 229 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List(Linked List)
题目Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.Language C/** * Definition fo原创 2016-05-21 14:12:35 · 211 阅读 · 0 评论 -
206. Reverse (Linked List)
题目:Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both?iteratively/** * Definition for singly-linked list. * struct ListNod原创 2016-05-21 11:57:21 · 295 阅读 · 0 评论 -
21. Merge Two Sorted Lists(Linked List)
TitleMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Language C/** * Definition for singly-linked list. *原创 2016-05-29 11:11:32 · 295 阅读 · 0 评论