华为笔试复盘 bfs-2 外卖员

#include <iostream>
#include <queue>
using namespace std;

struct node {
   
    int now, step;  
};
int n, m;
int check[100005];

int stepSize(int start, int target) {
   
    queue<node> que;
    que.push((node){
   start, 0});
    while (!que.empty()) {
   
        node temp = que.front();
        que.pop();