To find these crucial border points, we employed a clever technique based on the Ford-Fulkerson algorithm. By simulating "flooding" roads with traffic from random start/end points, we could identify the natural bottlenecks – the "minimum cut" in graph theory terms. These bottlenecks became our border points.
输入：nums = [2,1,2,4,3]
，更多细节参见夫子
刚刚，OpenClaw 在 GitHub 上已经冲到 23 万颗星了。它已经成为了 GitHub 史上增长速度最快的开源 AI 项目。
Фото: Vincent Thian / AP
const len = nums.length;