leetcode 1030. Matrix Cells in Distance Order

本文主要是介绍leetcode 1030. Matrix Cells in Distance Order，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

leetcode 1030. Matrix Cells in Distance Order

题意：给你一个矩阵的长宽，再给你一个点的坐标，把矩阵中的每个点按距离这个点的距离排序。

思路：用结构体保存坐标和距离，再排序。

struct node
{int x;int y;int dis;
};
bool cmp(node a, node b)
{if (a.dis == b.dis){if (a.x == b.x)return a.y < b.y;return a.x < b.x;}return a.dis < b.dis;
}
class Solution {
public:vector<vector<int>> allCellsDistOrder(int R, int C, int r0, int c0) {vector<node> a;for (int i = 0; i < R; i++){for (int j = 0; j < C; j++){node x;x.x = i;x.y = j;x.dis = abs(r0 - i) + abs(c0 - j);a.push_back(x);}}sort(a.begin(), a.end(), cmp);vector<vector<int>> ans;for (int i = 0; i < a.size(); i++){vector<int> tmp;tmp.push_back(a[i].x);tmp.push_back(a[i].y);ans.push_back(tmp);}return ans;}
};

 

这篇关于leetcode 1030. Matrix Cells in Distance Order的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---