![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
深度遍历和宽度遍历
zhaohoutao
这个作者很懒,什么都没留下…
展开
-
LeetCode-200 岛屿数量
岛屿数量使用深度遍历搜索class Solution {public: void DFS(vector<vector<char>>& grid, vector<vector<int>> &flag, int x, int y){ int col = grid.size(); int row = grid[0].s...原创 2019-07-07 20:12:47 · 108 阅读 · 0 评论 -
LeetCode 529 扫雷游戏
扫雷游戏class Solution {public: int cal(int x, int y, vector<vector<char>>& board){ int col = board.size(); int row = board[0].size(); int dx[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };...原创 2019-08-17 12:56:27 · 206 阅读 · 0 评论 -
LeetCode 127 单词接龙
单词接龙时间超时class Solution {public: bool isvalue(string s1, string s2){ int len = s1.size(); int count = 0; for (int i = 0; i<len; ++i) { if (s1[i] != s2[i]) ++count; } if (count ==...原创 2019-08-12 17:05:56 · 168 阅读 · 0 评论 -
LeetCode 542 01 矩阵
01 矩阵class Solution {public: vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) { int col = matrix.size(); int row = matrix[0].size(); ...原创 2019-08-25 15:20:11 · 371 阅读 · 0 评论 -
LeetCode 51 N皇后
N皇后class Solution {public: vector<vector<string>> result;void DFS(int count, int n, vector<int>& jilu){ if (count == n) { vector<string> temp; for (int i = 0...原创 2019-08-14 15:48:00 · 104 阅读 · 1 评论 -
LeetCode 756 金字塔转换矩阵
金字塔转换矩阵class Solution {public: bool huisu(string& nowStr, string nextStr, vector<string> allowed) { int nowStrsize = nowStr.size(); int nextStrsize = nextStr.size(...原创 2019-07-22 18:49:40 · 219 阅读 · 0 评论 -
LeetCode 130 被围绕的区域
被围绕的区域class Solution {public: void DFS(vector<vector<char>>& board, int x, int y)//从边界处如果有O的话将它以及和他相关联的进行改变 { int col = board.size(); int row = board[0].size...原创 2019-07-26 00:00:09 · 302 阅读 · 0 评论 -
LeetCode-93 复原IP地址
复原IP地址使用回溯法class Solution {public: bool isvalid(string s) { if (s.empty() || (s[0] == '0'&&s.size() != 1)) return false; int tmp = atoi(s.c_str()); ...原创 2019-07-17 20:54:11 · 102 阅读 · 0 评论 -
马走日算法-回溯
马走日算法-回溯1.马走日走到目标节点最少的步数#include<iostream>#include<queue>#include<functional>#include<stack>#include<string>#include<vector>#include<set>#include<...原创 2019-07-19 12:06:18 · 1703 阅读 · 0 评论 -
LeetCode-297 二叉树的序列化与反序列化
二叉树的序列化与反序列化超出内存限制了。。原创 2019-07-15 17:34:16 · 103 阅读 · 0 评论 -
LeetCode 207 课程表
课程表class Solution {public: bool canFinish(int numCourses, vector<vector<int>>& prerequisites) { //图的深度或者宽度遍历算法,使用拓扑排序也是可行的而且相对来说简单一点 //建立映射机制进行相应的,直接拓扑排序吧 vector<int> ru...原创 2019-08-17 14:44:22 · 83 阅读 · 0 评论