?LeetCode刷題實(shí)戰(zhàn)573：松鼠模擬

class?Solution?{
public:
????int?minDistance(int?height, int?width, vector<int>& tree, vector<int>& squirrel, vector<vector<int>>& nuts)?{
????????int?sum_nums=0;
????????//先統(tǒng)計(jì)出所有堅(jiān)果的距離
????????for(vector<int>&nut:nuts){
????????????sum_nums+=abs(nut[0]-tree[0])+abs(nut[1]-tree[1]);
????????}
????????sum_nums<<=1;
????????int?res=INT_MAX;
????????//針對(duì)每個(gè)堅(jiān)果作為松鼠要取的第一個(gè)堅(jiān)果，計(jì)算各個(gè)距離，并保存最小的距離
????????for(vector<int>&nut:nuts){
????????????res=min(res,sum_nums-(abs(nut[0]-tree[0])+abs(nut[1]-tree[1]))+(abs(nut[0]-squirrel[0])+abs(nut[1]-squirrel[1])));
????????}
????????return?res;
????}
};