HDU - 1195：Open the Lock（BFS）

Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.
Each time, you can add or minus 1 to any digit. When add 1 to ‘9’, the digit will change to be ‘1’ and when minus 1 to ‘1’, the digit will change to be ‘9’. You can also exchange the digit with its neighbor. Each action will take one step.

Now your task is to use minimal steps to open the lock.

Note: The leftmost digit is not the neighbor of the rightmost digit.
Input
The input file begins with an integer T, indicating the number of test cases.

Each test case begins with a four digit N, indicating the initial state of the password lock. Then followed a line with anotther four dight M, indicating the password which can open the lock. There is one blank line after each test case.
Output
For each test case, print the minimal steps in one line.
Sample Input
2
1234
2144

1111
9999
Sample Output
2
4

题目描述

给出2行数字，通过改变第一行的数字，使得与第二行数字相同，每个数字可以+1、-1、与相邻数字交换，都增加一次操作次数，求最少操作次数

思路：最少操作次数就会想到广搜，这也是很典型的广搜，需要注意的时，在每次试探时，都需要为next赋值为当前循环的now，这是广搜算法中比较重要的一点（保证所有情况都能试探到）

代码如下

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>

using namespace std;

struct node
{
   
    int num[4],step;
}pre,last;
int book[11][11][11][11];

void bfs()
{
   
    int i;
    node now,next;
    queue<node> q;
    now = pre;
    now.step = 0;
    book[now.num[0]][now.num[1]][now.num[2]][now.num[3]