// 题目保证nums1的元素都在nums2中，无需额外判空
Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log4(n)\log_4(n)log4(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.
，这一点在同城约会中也有详细论述
Speaking to Matt Chorley on BBC 5 Live on Thursday, Milburn dismissed the idea that there was a "snowflake" generation who were reluctant to work or less resilient than previous generations.。快连下载安装对此有专业解读
Just look at the numbers for processing the entire planet for a car profile: