矩阵
沙扬娜拉的裙裾
刚刚步入计算机大军的小草虚心请教
展开
-
leetcode#130-被围绕的区域
class Solution { public: void solve(vector<vector<char>>& board) { if(board.size()<=0) return; int m = board.size();//行 int n = board[0].size();//列 for(int i=0;i<n;i++){ dfs(board,0,i);.原创 2020-08-29 16:20:38 · 105 阅读 · 0 评论 -
矩阵-单词搜索
class Solution { public: bool exist(vector<vector<char>>& board, string word) { if(board.size()<=0) return false; int m = board.size()-1; int n = board[0].size()-1; vector<vector<bool>> vis.原创 2020-08-19 17:41:00 · 201 阅读 · 0 评论 -
矩阵-leetcode#54-螺旋打印矩阵
class Solution { public: vector<int> spiralOrder(vector<vector<int>>& matrix) { vector<int> res; if(matrix.size()<=0) return res; int m = matrix.size()-1; int n = matrix[0].size()-1; .原创 2020-08-16 22:52:11 · 134 阅读 · 0 评论