James Pan

原题网址：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/h-index/ Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. Accordi

原题网址：https://leetcode.com/problems/wiggle-sort-ii/ Given an unsorted array nums, reorder it such that nums[0] nums[2] . Example: (1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is

原题网址：https://leetcode.com/problems/kth-largest-element-in-an-array/ Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth dis

原题网址：https://leetcode.com/problems/majority-element-ii/ Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1

原题网址：https://leetcode.com/problems/median-of-two-sorted-arrays/ There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run t

原题网址：https://leetcode.com/problems/find-median-from-data-stream/ Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is

原题网址：https://leetcode.com/problems/ugly-number-ii/ Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2