09 2015 档案

[LeetCode]Move Zeroes
摘要：Move ZeroesGiven an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For exam... 阅读全文
posted @ 2015-09-24 14:32 Sean_le 阅读(154) 评论(0) 推荐(0)
[problem]快速排序和归并排序
摘要：最近有时间了解下快速排序和归并排序。开始觉得很难，一直没有啃这块骨头，现在发现理解了并不难。快排的思路就是指定一个值，然后将小于他的排到其左边，大于他的排到其右边。 1 #include 2 #include 3 #include 4 #include 5 using namespace s... 阅读全文
posted @ 2015-09-23 16:43 Sean_le 阅读(190) 评论(0) 推荐(0)
[LeetCode]Reverse Bits
摘要：Reverse BitsReverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as000000101001010000011110100111... 阅读全文
posted @ 2015-09-17 16:22 Sean_le 阅读(129) 评论(0) 推荐(0)
[LeetCode]Minimum Depth of Binary Tree
摘要：Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root... 阅读全文
posted @ 2015-09-17 11:46 Sean_le 阅读(134) 评论(0) 推荐(0)
[LeetCode]Merge Sorted Array
摘要：Merge Sorted ArrayGiven two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.Note:You may assume thatnums1has enough space (... 阅读全文
posted @ 2015-09-17 11:26 Sean_le 阅读(147) 评论(0) 推荐(0)
[LeetCode]Combination Sum III
摘要：Combination Sum IIIFind all possible combinations ofknumbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combin... 阅读全文
posted @ 2015-09-17 10:37 Sean_le 阅读(134) 评论(0) 推荐(0)
[LeetCode]Combination Sum
摘要：Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thes... 阅读全文
posted @ 2015-09-17 10:24 Sean_le 阅读(147) 评论(0) 推荐(0)
[LeetCode]Combination Sum II
摘要：Combination Sum IIGiven a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sum... 阅读全文
posted @ 2015-09-17 10:16 Sean_le 阅读(183) 评论(0) 推荐(0)
[LeetCode]Longest Consecutive Sequence
摘要：Longest Consecutive SequenceGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4... 阅读全文
posted @ 2015-09-17 00:13 Sean_le 阅读(158) 评论(0) 推荐(0)
[LeetCode]Path Sum
摘要：Path SumGiven 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 give... 阅读全文
posted @ 2015-09-16 23:28 Sean_le 阅读(155) 评论(0) 推荐(0)
[LeetCode]House Robber
摘要：House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint... 阅读全文
posted @ 2015-09-16 23:06 Sean_le 阅读(126) 评论(0) 推荐(0)
[LeetCode]Binary Search Tree Iterator
摘要：Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callin... 阅读全文
posted @ 2015-09-16 21:54 Sean_le 阅读(123) 评论(0) 推荐(0)
[LeetCode]Pascal's Triangle II
摘要：Pascal's Triangle IIGiven an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your alg... 阅读全文
posted @ 2015-09-16 20:29 Sean_le 阅读(100) 评论(0) 推荐(0)
[LeetCode]Pascal's Triangle
摘要：Pascal's TriangleGivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,... 阅读全文
posted @ 2015-09-16 20:25 Sean_le 阅读(123) 评论(0) 推荐(0)
[LeetCode]Implement Stack using Queues
摘要：Implement Stack using QueuesImplement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the eleme... 阅读全文
posted @ 2015-09-16 18:12 Sean_le 阅读(112) 评论(0) 推荐(0)
[LeetCode]Sum Root to Leaf Numbers
摘要：Sum Root to Leaf NumbersGiven a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-l... 阅读全文
posted @ 2015-09-16 17:11 Sean_le 阅读(143) 评论(0) 推荐(0)
[LeetCode]Remove Duplicates from Sorted Array II
摘要：Remove Duplicates from Sorted Array IIFollow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted arraynums... 阅读全文
posted @ 2015-09-16 16:24 Sean_le 阅读(110) 评论(0) 推荐(0)
[LeetCode]First Bad Version
摘要：First Bad VersionYou are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fa... 阅读全文
posted @ 2015-09-16 16:10 Sean_le 阅读(106) 评论(0) 推荐(0)
[LeetCode]Perfect Squares
摘要：Perfect SquaresGiven a positive integern, find the least number of perfect square numbers (for example,1, 4, 9, 16, ...) which sum ton.For example, gi... 阅读全文
posted @ 2015-09-16 15:45 Sean_le 阅读(106) 评论(0) 推荐(0)
[LeetCode]Kth Smallest Element in a BST
摘要：Kth Smallest Element in a BSTGiven a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is alw... 阅读全文
posted @ 2015-09-16 11:17 Sean_le 阅读(134) 评论(0) 推荐(0)
[LeetCode]Remove Duplicates from Sorted Array
摘要：Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new lengt... 阅读全文
posted @ 2015-09-16 10:48 Sean_le 阅读(96) 评论(0) 推荐(0)
[LeetCode]Combinations
摘要：CombinationsGiven two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3... 阅读全文
posted @ 2015-09-16 10:33 Sean_le 阅读(145) 评论(0) 推荐(0)
[LeetCode]Search in Rotated Sorted Array II
摘要：Search in Rotated Sorted Array IIFollow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity... 阅读全文
posted @ 2015-09-15 14:35 Sean_le 阅读(133) 评论(0) 推荐(0)
[LeetCode]Binary Tree Level Order Traversal II
摘要：Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level... 阅读全文
posted @ 2015-09-14 22:52 Sean_le 阅读(112) 评论(0) 推荐(0)
[LeetCode]Binary Tree Level Order Traversal
摘要：Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).Fo... 阅读全文
posted @ 2015-09-14 16:42 Sean_le 阅读(128) 评论(0) 推荐(0)
[LeetCode]H-Index II
摘要：H-Index IIFollow upforH-Index: What if thecitationsarray is sorted in ascending order? Could you optimize your algorithm?二分查找，时间复杂度O(logn)。 1 class So... 阅读全文
posted @ 2015-09-14 11:00 Sean_le 阅读(150) 评论(0) 推荐(0)
[LeetCode]H-Index
摘要：H-IndexGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.Acc... 阅读全文
posted @ 2015-09-14 10:19 Sean_le 阅读(144) 评论(0) 推荐(0)
[LeetCode]Symmetric Tree
摘要：Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric... 阅读全文
posted @ 2015-09-14 00:11 Sean_le 阅读(170) 评论(0) 推荐(0)
[LeetCode]Remove Element
摘要：Remove ElementGiven an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. ... 阅读全文
posted @ 2015-09-13 23:40 Sean_le 阅读(103) 评论(0) 推荐(0)
[LeetCode]Search a 2D Matrix II
摘要：Search a 2D Matrix IIWrite an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each ... 阅读全文
posted @ 2015-09-13 20:45 Sean_le 阅读(150) 评论(0) 推荐(0)
[LeetCode]Search a 2D Matrix
摘要：Search a 2D MatrixWrite an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row... 阅读全文
posted @ 2015-09-13 20:28 Sean_le 阅读(130) 评论(0) 推荐(0)
[LeetCode]Trapping Rain Water
摘要：Trapping Rain WaterGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to tr... 阅读全文
posted @ 2015-09-13 17:01 Sean_le 阅读(162) 评论(0) 推荐(0)
[LeetCode]Container With Most Water
摘要：Container With Most WaterGivennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such t... 阅读全文
posted @ 2015-09-11 18:14 Sean_le 阅读(152) 评论(0) 推荐(0)
[LeetCode]Permutations
摘要：Permutations Given a collection of numbers, return all possible permutations. For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2 阅读全文
posted @ 2015-09-10 15:45 Sean_le 阅读(134) 评论(0) 推荐(0)
[LeetCode]Missing Number
摘要：Missing NumberGiven an array containingndistinct numbers taken from0, 1, 2, ..., n, find the one that is missing from the array.For example,Givennums=... 阅读全文
posted @ 2015-09-10 15:08 Sean_le 阅读(108) 评论(0) 推荐(0)
[LeetCode]Set Matrix Zeroes
摘要：Set Matrix ZeroesGiven amxnmatrix, if an element is 0, set its entire row and column to 0. Do it in place.空间复杂度O(1)，不能使用额外的空间，那得多重复几次。判断第一行和第一列是否有0，用于... 阅读全文
posted @ 2015-09-10 11:26 Sean_le 阅读(152) 评论(0) 推荐(0)
[LeetCode]Find Peak Element
摘要：Find Peak ElementA peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and ... 阅读全文
posted @ 2015-09-09 23:16 Sean_le 阅读(102) 评论(0) 推荐(0)
[LeetCode]Balanced Binary Tree
摘要：Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tre... 阅读全文
posted @ 2015-09-09 23:01 Sean_le 阅读(118) 评论(0) 推荐(0)
[LeetCode]Spiral Matrix II
摘要：Spiral Matrix IIGiven an integern, generate a square matrix filled with elements from 1 ton2in spiral order.For example,Givenn=3,You should return the... 阅读全文
posted @ 2015-09-09 22:39 Sean_le 阅读(105) 评论(0) 推荐(0)
[LeetCode]Spiral Matrix
摘要：Spiral MatrixGiven a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.For example,Given the following matrix:[... 阅读全文
posted @ 2015-09-09 22:31 Sean_le 阅读(208) 评论(0) 推荐(0)
[LeetCode]Rotate Image
摘要：Rotate ImageYou are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?每次转换四个点... 阅读全文
posted @ 2015-09-09 21:20 Sean_le 阅读(139) 评论(0) 推荐(0)
[LeetCode]Minimum Path Sum
摘要：Minimum Path SumGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along ... 阅读全文
posted @ 2015-09-09 19:47 Sean_le 阅读(135) 评论(0) 推荐(0)
[LeetCode]Generate Parentheses
摘要：Generate ParenthesesGivennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a sol... 阅读全文
posted @ 2015-09-09 18:37 Sean_le 阅读(125) 评论(0) 推荐(0)
[LeetCode]Gray Code
摘要：Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the tot... 阅读全文
posted @ 2015-09-09 17:29 Sean_le 阅读(838) 评论(0) 推荐(0)
[LeetCode]Unique Paths
摘要：Unique PathsA 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 a... 阅读全文
posted @ 2015-09-09 16:45 Sean_le 阅读(99) 评论(0) 推荐(0)
[NLP]文本去除非汉字字符
摘要：最近有个需求就是去除一个文本里面所有的非汉字字符。 unicide的汉字有个范围u4e00-u9fa5。所以这个范围内的留下来就可以了。 1 blog=u"【雅虎开始提示Chrome用户“升级”到Firefox】http://t.cn/RzHTFF5 国外有关浏览器、搜索引擎那些事儿，也是刀光剑影， 阅读全文
posted @ 2015-09-08 13:56 Sean_le 阅读(642) 评论(0) 推荐(0)
[LeetCode]Search in Rotated Sorted Array
摘要：Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).... 阅读全文
posted @ 2015-09-07 20:02 Sean_le 阅读(142) 评论(0) 推荐(0)
[LeetCode]Find Minimum in Rotated Sorted Array II
摘要：Find Minimum in Rotated Sorted Array IIFollow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time... 阅读全文
posted @ 2015-09-07 19:27 Sean_le 阅读(113) 评论(0) 推荐(0)
[LeetCode]Find Minimum in Rotated Sorted Array
摘要：Find Minimum in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0... 阅读全文
posted @ 2015-09-07 19:15 Sean_le 阅读(115) 评论(0) 推荐(0)
[LeetCode]Implement Queue using Stacks
摘要：Implement Queue using StacksImplement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes... 阅读全文
posted @ 2015-09-07 17:25 Sean_le 阅读(143) 评论(0) 推荐(0)
[LeetCode]Convert Sorted List to Binary Search Tree
摘要：Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.... 阅读全文
posted @ 2015-09-07 16:56 Sean_le 阅读(119) 评论(0) 推荐(0)
[LeetCode]Convert Sorted Array to Binary Search Tree
摘要：Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.BST的规则就是左& ... 阅读全文
posted @ 2015-09-07 16:22 Sean_le 阅读(113) 评论(0) 推荐(0)
[LeetCode]Maximum Product Subarray
摘要：Maximum Product SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given... 阅读全文
posted @ 2015-09-07 11:20 Sean_le 阅读(84) 评论(0) 推荐(0)
[LeetCode]Product of Array Except Self
摘要：Product of Array Except SelfGiven an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the eleme... 阅读全文
posted @ 2015-09-07 10:23 Sean_le 阅读(133) 评论(0) 推荐(0)
[LeetCode]Maximum Subarray
摘要：Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−... 阅读全文
posted @ 2015-09-06 23:55 Sean_le 阅读(94) 评论(0) 推荐(0)
[LeetCode]Climbing Stairs
摘要：Climbing StairsYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct way... 阅读全文
posted @ 2015-09-06 23:25 Sean_le 阅读(162) 评论(0) 推荐(0)
[LeetCode]Single Number III
摘要：Single Number IIIGiven an array of numbersnums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find t... 阅读全文
posted @ 2015-09-06 22:27 Sean_le 阅读(130) 评论(0) 推荐(0)
[LeetCode]Single Number II
摘要：Single Number IIGiven an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a lin... 阅读全文
posted @ 2015-09-06 20:01 Sean_le 阅读(107) 评论(0) 推荐(0)
[LeetCode]Search Insert Position
摘要：Search Insert PositionGiven 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 ... 阅读全文
posted @ 2015-09-06 18:22 Sean_le 阅读(114) 评论(0) 推荐(0)
[LeetCode]Unique Binary Search Trees
摘要：Unique Binary Search TreesGivenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a to... 阅读全文
posted @ 2015-09-06 17:03 Sean_le 阅读(134) 评论(0) 推荐(0)
[LeetCode]Majority Element
摘要：Majority ElementGiven an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may ass... 阅读全文
posted @ 2015-09-06 16:08 Sean_le 阅读(201) 评论(0) 推荐(0)
[LeetCode]N-Queens II
摘要：N-Queens IIFollow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.和上题N-Queens几乎一样，... 阅读全文
posted @ 2015-09-06 00:00 Sean_le 阅读(126) 评论(0) 推荐(0)
[LeetCode]N-Queens
摘要：N-QueensThen-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all... 阅读全文
posted @ 2015-09-05 23:58 Sean_le 阅读(184) 评论(0) 推荐(0)
[LeetCode]Populating Next Right Pointers in Each Node II
摘要：Populating Next Right Pointers in Each Node IIFollow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any ... 阅读全文
posted @ 2015-09-05 14:51 Sean_le 阅读(142) 评论(0) 推荐(0)
[LeetCode]Populating Next Right Pointers in Each Node
摘要：Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLi... 阅读全文
posted @ 2015-09-05 13:20 Sean_le 阅读(119) 评论(0) 推荐(0)
[LeetCode]Binary Tree Postorder Traversal
摘要：Binary Tree Postorder TraversalGiven a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \... 阅读全文
posted @ 2015-09-04 23:42 Sean_le 阅读(115) 评论(0) 推荐(0)
[LeetCode]Binary Tree Inorder Traversal
摘要：Binary Tree Inorder TraversalGiven a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ... 阅读全文
posted @ 2015-09-04 23:38 Sean_le 阅读(120) 评论(0) 推荐(0)
[LeetCode]Binary Tree Preorder Traversal
摘要：Binary Tree Preorder TraversalGiven a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ... 阅读全文
posted @ 2015-09-04 22:45 Sean_le 阅读(133) 评论(0) 推荐(0)
[LeetCode]Number of 1 Bits
摘要：Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For exampl... 阅读全文
posted @ 2015-09-04 22:28 Sean_le 阅读(89) 评论(0) 推荐(0)
[LeetCode]Best Time to Buy and Sell Stock IV
摘要：Best Time to Buy and Sell Stock IVSay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the ... 阅读全文
posted @ 2015-09-04 20:19 Sean_le 阅读(119) 评论(0) 推荐(0)
[LeetCode]Best Time to Buy and Sell Stock III
摘要：Best Time to Buy and Sell Stock IIISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the... 阅读全文
posted @ 2015-09-04 17:15 Sean_le 阅读(124) 评论(0) 推荐(0)
[LeetCode]Best Time to Buy and Sell Stock
摘要：Best Time to Buy and Sell StockSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to compl... 阅读全文
posted @ 2015-09-04 12:27 Sean_le 阅读(170) 评论(0) 推荐(0)
[LeetCode]Best Time to Buy and Sell Stock II
摘要：Best Time to Buy and Sell Stock IISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the ... 阅读全文
posted @ 2015-09-04 12:17 Sean_le 阅读(103) 评论(0) 推荐(0)
[LeetCode]Delete Node in a Linked List
摘要：Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the l... 阅读全文
posted @ 2015-09-04 11:53 Sean_le 阅读(126) 评论(0) 推荐(0)