leetcode 1620. 网络信号最好的坐标

Problem: 1620. 网络信号最好的坐标

整数坐标点，而且点数比较少，所以直接遍历每一个点，计算出答案，求出最大值，已经对应的坐标

Code

class Solution { public: vector<int> bestCoordinate(vector<vector<int>>& towers, int radius) { int x = 0, y = 0, n = towers.size(), retx, rety; if(n==1) { if(towers[0][2]==0) return {0, 0}; return {towers[0][0], towers[0][1]}; } int mx = INT_MIN, mix = 100, mxx = -100, miy = 100, mxy = -100, a, c; for(vector<int>& tp : towers) { a = tp[0]; c = tp[1]; mix = min(a, mix); miy = min(c, miy); mxx = max(a, mxx); mxy = max(c, mxy); } mix = max(0, mix - radius); miy = max(0, miy - radius); mxx = mxx + radius; mxy = mxy + radius; double sum, dd, tx, ty; for(int cx = mix; cx < mxx; cx++) { for(int cy = miy; cy < mxy; cy++) { sum = 0; for(vector<int>& tmp : towers) { tx = cx - (double)tmp[0]; ty = cy - (double)tmp[1]; dd = sqrt(pow(tx, 2) + pow(ty, 2)); if(dd > radius) continue; sum += floor(tmp[2] / (double)( 1.0 + dd)); if(mx < (int)sum) { mx = sum; retx = cx; rety = cy; } else if(mx == (int)sum) { if(cx < retx) { retx = cx; rety = cy; } else if((int)cx == retx && cy < rety) { retx = cx; rety = cy; } } } } } return {retx, rety}; } };