随便写一个求曼哈顿(费马点?)的方法

给出平面上n个点,求一个点使所有点到这个点的曼哈顿距离最小.

求曼哈顿距离的时候横坐标和纵坐标貌似是分别独立的. 即最小时横坐标一定最小,纵坐标一定最小,那么分别排序求个中位数就好了...(口胡)

Sometimes it s the very people who no one imagines anything of. who do the things that no one can imagine.
原文地址:https://www.cnblogs.com/YCuangWhen/p/5243186.html