03 2018 档案

283. Move Zeroes
摘要：Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文
posted @ 2018-03-07 08:29 SuperStar~ 阅读(84) 评论(0) 推荐(0)
226. Invert Binary Tree
摘要：Invert a binary tree. to 阅读全文
posted @ 2018-03-05 14:03 SuperStar~ 阅读(89) 评论(0) 推荐(0)
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 l 阅读全文
posted @ 2018-03-05 11:29 SuperStar~ 阅读(70) 评论(0) 推荐(0)
136. Single Number
摘要：Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime comple 阅读全文
posted @ 2018-03-05 10:45 SuperStar~ 阅读(89) 评论(0) 推荐(0)
617. Merge Two Binary Trees
摘要：Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文
posted @ 2018-03-04 22:26 SuperStar~ 阅读(104) 评论(0) 推荐(0)
53. Maximum Subarray
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2, 阅读全文
posted @ 2018-03-04 11:39 SuperStar~ 阅读(92) 评论(0) 推荐(0)
121. Best Time to Buy and Sell Stock
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2018-03-04 09:31 SuperStar~ 阅读(117) 评论(0) 推荐(0)
232. Implement Queue using Stacks
摘要：mplement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
posted @ 2018-03-03 21:04 SuperStar~ 阅读(92) 评论(0) 推荐(0)
145. Binary Tree Postorder Traversal
摘要：Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree [1,null,2,3], 阅读全文
posted @ 2018-03-03 19:05 SuperStar~ 阅读(144) 评论(0) 推荐(0)
108. Convert Sorted Array to Binary Search Tree
摘要：Description: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bin 阅读全文
posted @ 2018-03-01 15:47 SuperStar~ 阅读(138) 评论(0) 推荐(0)