一:【备考】解题的思路
- 读懂题意 (5分钟)
- 确定要使用的数据结构(简易C++STL容器)
- 确定程序设计的思路 >> 【编程思维】
- 先把程序写对(编程思维) >> 先把程序写快(算法思维)
- 【算法思维】优化代码 >> 二分法,模拟链表,排序树,DFS,BFS,递归…
二:【考试】解题的思路
- 读懂题意
- 确定要使用的数据结构(简易C++STL容器)
- 确定程序设计的思路 >> 算法思维(二分法,DFS,BFS,双指针,哈希表…)
三:蓝桥杯题库 VS LeetCode题库
- 备考第一步使用LeetCode题库
- 备考第二步使用蓝桥杯题库
蓝桥杯题库的坑
Ⅰ 程序出错不给用户测试用例和输出结果
Ⅱ 官方题解必须充会员(想钱想疯了)
Ⅲ 用户少,用户解题质量不高(新手学不会什么东西)
DFS
深度优先遍历
先入后出,保证数据一条路走到底,再走另一条路
栈/递归
BFS
广度优先遍历
先入先出
队列
广泛用在树形结构(先中后序遍历)和图形结构
vector
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> vInt; //一维数组
vector<vector<int> > vvInt //二维数组
return 0;
}
代码示范
#include <iostream>
#incldue <vector>
#include <queue>
#include <string>
#include <stack>
typedef pair<int, int> Pos;
void print_grid(const vector<vector<char>> &grid)
{
for (int i = 0; i < grid.size(); i++)
{
for (int y = 0; y < grid[0].size(); y++)
{
cout << grid[x][y] << " ";
}
cout << endl;
}
cout << "------------------------------" << endl;
}
class Solution
{
public:
//方式一:广度优先 - 队列
void bfs(vector<vector<char>> & grid, int x, int y, char ID)
{
//1.将Pos(x,y)入队,保证队列不为空,正常进行循环
queue<Pos> qBuff;
qBuff.push(Pos(x, y));
while(qBuff.empty() == false)
{
//2.将队头元素出队
Pos e = qBuff.front();
qBuff.pop();
int nx = e.first;
int ny = e.second;
//3.将grid[nx][ny]值替换为其他无关的值
grid[nx][ny] = ID;
//4.广度优先搜索Pos(nx)(ny)的四周的陆地
if ((nx-1) > -1 && grid[nx-1][ny] == '1')
{
qBuff.push(Pos(nx-1, ny));
}
if ((ny-1) > -1 && grid[nx][ny-1] == '1')
{
qBuff.push(Pos(nx, ny-1));
}
if ((nx+1 < grid.size()) && grid[nx+1][ny] == '1')
{
qBuff.push(Pos(nx+1, ny));
}
if ((ny+1 < grid[0].size()) && grid[nx][ny+1] == '1')
{
qBuff.push(Pos(nx, ny+1));
}
}
}
//方式二:深度优先 - 栈
void dfs(vector<vector<char>> & grid, int x, int y, char ID)
{
//1.将Pos(x,y)入栈,保证开始时栈不为空,能正常进入循环
stack<Pos> qBuff;
qBuff.push(Pos(x, y));
while(qBuff.empty() == false)
{
//2.将栈顶元素出栈
Pos e = qBuff.top();
qBuff.pop();
int nx = e.first;
int ny = e.second;
//3.将grid[nx][ny]值替换为其他无关的值
grid[nx][ny] = ID;
//4.广度优先搜索Pos(nx)(ny)的四周的陆地
if ((nx-1) > -1 && grid[nx-1][ny] == '1')
{
qBuff.push(Pos(nx-1, ny));
}
if ((ny-1) > -1 && grid[nx][ny-1] == '1')
{
qBuff.push(Pos(nx, ny-1));
}
if ((nx+1 < grid.size()) && grid[nx+1][ny] == '1')
{
qBuff.push(Pos(nx+1, ny));
}
if ((ny+1 < grid[0].size()) && grid[nx][ny+1] == '1')
{
qBuff.push(Pos(nx, ny+1));
}
}
}
//方式三:深度优先 - 递归
void dfs2(vector<vector<char>> & grid, int x, int y, char ID)
{
//1.将grid[nx][ny]值替换为其他无关的值
grid[nx][ny] = ID;
//2.广度优先搜索Pos(nx)(ny)的四周的陆地
if ((x-1) > -1 && grid[x-1][y] == '1')
{
dfs2(grid, x-1, y, ID);
}
if ((y-1) > -1 && grid[x][y-1] == '1')
{
dfs2(grid, x, y-1, ID);
}
if ((x+1 < grid.size()) && grid[x+1][y] == '1')
{
dfs2(grid, x+1, y, ID);
}
if ((y+1 < grid[0].size()) && grid[x][y+1] == '1')
{
dfs2(grid, x, y+1, ID);
}
}
int numIslands(vector<vector<char>> & grid)
{
int cnt = 0;
//第二步,找到地图中所有的陆地
for (int x = 0; x < grid.size(); x++)
{
for (int y = 0; y < grid[x].size(); y++)
{
if(grid[x][y] == '1')
{
//第三步,通过深度优先搜索,确定岛屿
bfs(grid, x, y, 'Z');
cnt++;
}
}
}
return cnt;
}
}
int main()
{
//第一步,前置地图,提前输入东西
vector<vector<char>> grid;
string line1 = "11000";
vector<char> v1(5, '0');
for (int i = 0; i < line1.length(); i++)
{
v1[i] = line1[i];
}
string line2 = "11000";
vector<char> v2(5, '0');
for (int i = 0; i < line2.length(); i++)
{
v2[i] = line2[i];
}
string line3 = "00100";
vector<char> v3(5, '0');
for (int i = 0; i < line3.length(); i++)
{
v3[i] = line3[i];
}
string line4 = "00011";
vector<char> v4(5, '0');
for (int i = 0; i < line4.length(); i++)
{
v4[i] = line4[i];
}
grid.push_back(v1);
grid.push_back(v2);
grid.push_back(v3);
grid.push_back(v4);
print_grid(grid);
cout << numIslands(grid) << endl;
return 0;
}