What We're Looking For in You:
▲ 图源：9To5Google
。业内人士推荐WPS官方版本下载作为进阶阅读
Instead of taking the nearest candidates to , we can look for a set of candidates whose centroid is close to . The N-convex algorithm works by finding the closest colour to a given target colour for iterations, where the target is first initialised to be equal to the input pixel. Every iteration the closest colour added to the candidate list, and the quantisation error between it and the original input pixel is added to the target.
输入：prices = [8,4,6,2,3]