思路：① 找初始左边界：第一个 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。
Another way to look at our threshold matrix is as a kind of probability matrix. Instead of offsetting the input pixel by the value given in the threshold matrix, we can instead use the value to sample from the cumulative probability of possible candidate colours, where each colour is assigned a probability or weight . Each colour’s weight represents it’s proportional contribution to the input colour. Colours with greater weight are then more likely to be picked for a given pixel and vice-versa, such that the local average for a given region should converge to that of the original input value. We can call this the N-candidate approach to palette dithering.，更多细节参见heLLoword翻译官方下载
NYT Connections hints today: Clues, answers for February 27, 2026，更多细节参见搜狗输入法2026
行政执法监督机构对通过涉企行政执法诉求沟通机制、政务服务便民热线等渠道反映的行政执法问题线索及时进行研判，确定重点监督事项。，这一点在旺商聊官方下载中也有详细论述