抄的这个大佬的
https://leetcode-cn.com/problems/matrix-cells-in-distance-order/solution/ju-chi-shun-xu-pai-lie-ju-zhen-dan-yuan-ge-by-gpe3/
class Solution {
public:
vector<vector<int>> allCellsDistOrder(int R, int C, int r0, int c0) {
vector<vector<int>> nums(R*C,vector<int>(3,0));
int count = 0;
for(int i=0;i<R;++i){
for(int j=0;j<C;++j){
nums[count][0] = i;
nums[count][1] = j;
nums[count][2] = abs(i-r0) + abs(j-c0);
++count;
}
}
sort(nums.begin(), nums.end(),sortm);
for(int i=0;i<R*C;++i){
nums[i].pop_back();
}
return nums;
}
static bool sortm(vector<int> &s1,vector<int> &s2){ //用 static ??? 参数s1,s2是和待排序数组的元素类型一样
return s1[2]<s2[2];
}
};