徐丁天：class Solution0423 { public: vector<vector<int>> res; vector<int> dx = { 0,0,1,-1 }; vector<int> dy = { 1,-1,0,0 }; vector<int> temp; vector<vector<int>> showPath(vector<vector<int>>& matrix) { vector<vector<int>> backUp = matrix; int m = matrix.size(), n = matrix[0].size(); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { dfs(i, j, matrix, backUp[i][j]); if (!temp.empty()) { res.emplace_back(temp); temp.clear(); } } } return res; }