* 核心思路：找初始无序边界 + 计算区间最值 + 扩展边界
Scan the crate to find areas of algorithmic weaknesses in extreme cases, and write a sentence for each describing the problem, the potential solution, and quantifying the impact of the solution
。safew官方版本下载对此有专业解读
if urlparse(u).netloc != urlparse(BASE).netloc:
number of rounds so that the memory is under control: