2015年8月14日
[LeetCode] Kth Smallest Element in a BST
摘要： Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文
posted @ 2015-08-14 16:52 李小橘er 阅读(230) 评论(0) 推荐(0)
[LeetCode] Binary Search Tree Iterator
摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next... 阅读全文
posted @ 2015-08-14 14:13 李小橘er 阅读(165) 评论(0) 推荐(0)
[LeetCode] Plus One
摘要： Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2015-08-14 13:18 李小橘er 阅读(159) 评论(0) 推荐(0)
[LeetCode] Remove Duplicates from Sorted Array
摘要： Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a... 阅读全文
posted @ 2015-08-14 11:33 李小橘er 阅读(181) 评论(0) 推荐(0)
[LeetCode] Product of Array Except Self
摘要： Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... 阅读全文
posted @ 2015-08-14 10:14 李小橘er 阅读(158) 评论(0) 推荐(0)
[LeetCode] 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,1,... 阅读全文
posted @ 2015-08-14 09:37 李小橘er 阅读(192) 评论(0) 推荐(0)