James Pan

原题网址：https://leetcode.com/problems/first-bad-version/You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the

原题网址：https://leetcode.com/problems/h-index-ii/Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?Hint:Expected runtime c

原题网址：https://leetcode.com/problems/first-missing-positive/Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] retur

原题网址：https://leetcode.com/problems/inorder-successor-in-bst/Given a binary search tree and a node in it, find the in-order successor of that node in the BST.Note: If the given node has no in

原题网址：https://leetcode.com/problems/search-in-rotated-sorted-array-ii/Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity

原题网址：https://leetcode.com/problems/search-a-2d-matrix/Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each

原题网址：https://leetcode.com/problems/word-search/Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where

原题网址：https://leetcode.com/problems/search-in-rotated-sorted-array/Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2)

原题网址：https://leetcode.com/problems/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

原题网址：https://leetcode.com/problems/search-for-a-range/Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must

原题网址：https://leetcode.com/problems/longest-consecutive-sequence/Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4,

原题网址：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time

原题网址：https://leetcode.com/problems/closest-binary-search-tree-value-ii/Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target.Note:

原题网址：https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific tar

原题网址：https://leetcode.com/problems/two-sum-iii-data-structure-design/Design and implement a TwoSum class. It should support the following operations: add and find.add - Add the number to an

原题网址：https://leetcode.com/problems/closest-binary-search-tree-value/Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.Note:

原题网址：https://leetcode.com/problems/implement-strstr/Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.方法：KMP算法。p