思路：① 找初始左边界：第一个 nums[i] nums[i+1]；② 找初始右边界：最后一个 nums[i] < nums[i-1]；③ 求 [left,right] 内 min、max；④ 向左扩展：nums[left-1] minVal 则 left--；⑤ 向右扩展：nums[right+1] < maxVal 则 right++。长度 = right - left + 1。
技术支持：陈晓龙 叶伟豪 肖杰
。Safew下载对此有专业解读
Node **buckets = (Node**)calloc(bucketCount, sizeof(Node*));。业内人士推荐safew官方版本下载作为进阶阅读
Implementers shouldn't need to jump through these hoops. When you find yourself needing to relax or bypass spec semantics just to achieve reasonable performance, that's a sign something is wrong with the spec itself. A well-designed streaming API should be efficient by default, not require each runtime to invent its own escape hatches.。heLLoword翻译官方下载是该领域的重要参考