James Pan

原题网址：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/meeting-rooms/Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend

原题网址：https://leetcode.com/problems/merge-intervals/Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,1

原题网址：https://leetcode.com/problems/insert-interval/Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals w

原题网址：https://leetcode.com/problems/meeting-rooms-ii/Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of confe

原题网址：https://leetcode.com/problems/validate-binary-search-tree/Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtre

原题网址：https://leetcode.com/problems/range-addition/Assume you have an array of length n initialized with all 0's and are given k update operations.Each operation is represented as a triplet: 

原题网址：https://leetcode.com/problems/data-stream-as-disjoint-intervals/Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of dis

原题网址：https://leetcode.com/problems/patching-array/Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive ca

原题网址：https://leetcode.com/problems/strobogrammatic-number-iii/A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).Write a function to co

原题网址：https://leetcode.com/problems/summary-ranges/Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7

原题网址：https://leetcode.com/problems/count-of-range-sum/Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the su

原题网址：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/missing-ranges/Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.For example, given [0, 1, 3

原题网址：https://leetcode.com/problems/range-sum-query-immutable/Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2

原题网址：https://leetcode.com/problems/range-sum-query-2d-immutable/Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lowe

原题网址：https://leetcode.com/problems/range-sum-query-mutable/Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function mo

原题网址：https://leetcode.com/problems/range-sum-query-2d-mutable/Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower

原题网址：https://leetcode.com/problems/contains-duplicate-iii/Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] 

原题网址：http://www.lintcode.com/en/problem/consistent-hashing/一般的数据库进行horizontal shard的方法是指，把 id 对 数据库服务器总数 n 取模，然后来得到他在哪台机器上。这种方法的缺点是，当数据继续增加，我们需要增加数据库服务器，将 n 变为 n+1 时，几乎所有的数据都要移动，这就造成了不 consist