for (const component of components) {
2. 创建计数数组count，统计每个值出现次数
，详情可参考爱思助手下载最新版本
Some of these congates are cognate with only part of the word.
// 单调栈：存储"待匹配更大值"的元素，栈内保持单调递减（核心）
Implementations have had to develop their own strategies for dealing with this. Firefox initially used a linked-list approach that led to O(n) memory growth proportional to the consumption rate difference. In Cloudflare Workers, we opted to implement a shared buffer model where backpressure is signaled by the slowest consumer rather than the fastest.