leetCode1030

mac2025-04-13  18

class Solution { public: vector<vector<int>> allCellsDistOrder(int R, int C, int r0, int c0) { vector<vector<int>>ans; map<vector<int>,int>mp; vector<int>tmp; for(int i = 0;i<R;i++) { for(int j = 0;j<C;j++) { tmp.clear(); tmp.push_back(i); tmp.push_back(j); mp[tmp] = abs(i-r0) + abs(j-c0); ans.push_back(tmp); } } sort(ans.begin(),ans.end(),[&ans,&mp](vector<int> & a,vector<int> & b) { return mp[a]<mp[b]; }); return ans; } };

 

最新回复(0)