The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.
If you're looking for more puzzles, Mashable's got games now! Check out our games hub for Mahjong, Sudoku, free crossword, and more.
，详情可参考爱思助手下载最新版本
目前该业务的内部目标估值定为 10 亿美元以上，由于探讨尚处于早期保密阶段，最终交易形式与能否达成仍存变数。
// 易错点3：必须先判断stack2.length0，再访问stack2.at(-1)（避免栈空时取到undefined）