James Pan

原题网址：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/count-of-smaller-numbers-after-self/You are given an integer array nums and you have to return a new counts array. The counts array has the property where coun

原题网址:http://www.lintcode.com/en/problem/memcache/Implement a memcache which support the following features:get(curtTime, key). Get the key's value, return 2147483647 if key does not exis

原题网址：https://leetcode.com/problems/remove-duplicate-letters/Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You mus

原题网址：https://leetcode.com/problems/sliding-window-maximum/Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only

原题网址：https://leetcode.com/problems/russian-doll-envelopes/You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and on

原题网址：https://leetcode.com/problems/the-skyline-problem/A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose y

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

原题网址：http://www.lintcode.com/en/problem/mini-cassandra/Cassandra is a NoSQL storage. The structure has two-level keys.Level 1: raw_key. The same as hash_key or shard_key.Level 2: column_

原题网址：http://www.lintcode.com/en/problem/consistent-hashing-ii/在 Consistent Hashing I 中我们介绍了一个比较简单的一致性哈希算法，这个简单的版本有两个缺陷：增加一台机器之后，数据全部从其中一台机器过来，这一台机器的读负载过大，对正常的服务会造成影响。当增加到3台机器的时候，每台服务器的负载量不

原题网址：https://leetcode.com/problems/maximal-square/Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the foll

红黑树的两种基本操作做旋转和右旋转，LEFT_ROTATE(x)和RIGHT_ROTATE(x)分别表示以x为支点进行左旋转和右旋转。红黑树的插入操作以插入点为当前点（z），检查是否满足红黑树规则，如果不满足则调整，直至完全满足为止。根据当前点z的父节点和叔叔节点的颜色，可以分为均为红色以及叔叔节点为黑色的情况，而根据当前节点是父节点的做节点还是右节点分为两种情况。