定存什么：要下标/距离就栈里存索引，只要值就存值或存索引再 nums[i] 取。
await dropOld.writer.write(chunk1); // ok
，更多细节参见旺商聊官方下载
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.
Zu meinen Beiträgen