James Pan

原题网址：https://leetcode.com/problems/kth-smallest-element-in-a-bst/Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is

原题网址：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/word-search-ii/Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequenti

原题网址：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-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/add-and-search-word-data-structure-design/Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(

原题网址：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/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/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/search-a-2d-matrix-ii/Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in e

原题网址：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