"It was wonderful to see the developmental stages of the parade happen," he said.
* 时间复杂度: O(n^1.3)~O(n²) 取决于步长序列 空间复杂度: O(1) 稳定: ✗
。关于这个话题，夫子提供了深入分析
drop-newest: Discards incoming data when full. Useful when you want to process what you have without being overwhelmed.
// drop-oldest: Discard old data to make room