Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
圖像來源，Getty Images，详情可参考快连下载-Letsvpn下载
，推荐阅读heLLoword翻译官方下载获取更多信息
But that’s a lot of resetting! We can save a bunch of bandwidth by instead tracking the current foreground and background color in our renderer and only emitting a new color escape sequence when our desired color changes. This is an annoying amount of bookkeeping but it substantially cuts down on the amount of escape codes emitted.
// console.log(canSeePersonsCount([10,6,8,5,11,9])); // 输出 [3,1,2,1,1,0]（正确），详情可参考爱思助手下载最新版本