2015年8月15日
[LeetCode] Find Peak Element
摘要： A 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 return its index.... 阅读全文
posted @ 2015-08-15 17:30 李小橘er 阅读(191) 评论(0) 推荐(0)
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)
2015年8月13日
[LeetCode] Contains Duplicate
摘要： Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr... 阅读全文
posted @ 2015-08-13 14:32 李小橘er 阅读(180) 评论(0) 推荐(0)
[LeetCode] Majority Element
摘要： Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文
posted @ 2015-08-13 14:02 李小橘er 阅读(269) 评论(0) 推荐(0)
[LeetCode] 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 or... 阅读全文
posted @ 2015-08-13 12:49 李小橘er 阅读(212) 评论(0) 推荐(0)