据多方消息，本次发布有望带来多款入门级产品的更新。
The N-closest or N-best dithering algorithm is a straightforward solution to the N-candidate problem. As the name suggests, the set of candidates is given by the closest palette colours to the input pixel. To determine their weights, we simply take the inverse of the distance to the input pixel. This is essentially the inverse distance weighting (IDW) method for multivariate interpolation, also known as Shepard’s method. The following pseudocode sketches out a possible implementation:
，更多细节参见Line官方版本下载
// 测试用例验证（和你的逻辑完全匹配）
居民会议可以授权居民代表会议讨论决定上述事项。
Nature, Published online: 25 February 2026; doi:10.1038/d41586-026-00584-y