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:
注意：如果首次生成后你觉得不满意，让 AI 调整格式后，就无法导出到谷歌幻灯片了。，详情可参考雷电模拟器官方版本下载
ITmedia�̓A�C�e�B���f�B�A�������Ђ̓o�^���W�ł��B。业内人士推荐51吃瓜作为进阶阅读
const lines = [];