优势：时间复杂度O(d*(n+k))，d为位数，适合位数少的整数
int j = i - gap;
，推荐阅读同城约会获取更多信息
Read more in the Antiviral series
Looking to make the most of the latest Stuff Your Kindle Day? We've lined up everything you need to know about this popular event.
The capacity of each node (how many points it can hold before splitting) controls the shape of the tree. A low capacity means nodes split early, producing a deep tree with many small cells. A high capacity means nodes tolerate more points before splitting, producing a shallow tree with larger cells.