alibaba实习生笔试 - 跳格子

#include <iostream>
#include <vector>
#include <limits>


using namespace std;
int visit_updown[1024][1024]; //表示向上或者下
int min_dist = 1000000;
int dist = 0;
struct node
{
int x;
int y;




};
vector<struct node> path;
vector<struct node> best_path;
int matrix2[3][5] = { { 0, 3, 1, 0, 1 }, { 1, 1, 1, 0, 1 }, { 1, 1, 1, 1, 2 } };
void DFS_jump(const vector<vector<int>> &matrix, int i, int j, int n, int m);
/*请完成下面这个函数，实现题目要求的功能*/
/******************************开始写代码******************************/
void DFS_jump(const vector<vector<int>> &matrix, int i, int j, int n, int m)
{
int g;
struct node pos;
pos.x = j;
pos.y = i;
path.push_back(pos);
if (j == m - 1)
{
if (dist < min_dist)
{
min_dist = dist;
best_path = path;
}
}
else
{
if(matrix[i][j]!=0 )
{
///向右跳当前位置为i,j   i j+M[i][j]
dist = dist + 1;
g = matrix[i][j];


if (dist < min_dist && j + matrix[i][j] < m)
{

DFS_jump(matrix, i, j + g, n, m);

}
///向上跳
if (i - matrix[i][j] >= 0 && !visit_updown[i - matrix[i][j]][j] && dist < min_dist)
{

visit_updown[i - matrix[i][j]][j] = 1;
DFS_jump(matrix, i - g, j, n, m);
visit_updown[i - matrix[i][j]][j] = 0;

}
///向下跳
if (i + matrix[i][j] < n && !visit_updown[i + matrix[i][j]][j] && dist < min_dist)
{
visit_updown[i + matrix[i][j]][j] = 1;
DFS_jump(matrix, i + g, j, n, m);
visit_updown[i + matrix[i][j]][j] = 0;
}
dist = dist - 1;
}








}
path.pop_back();


}


int jump(const vector<vector<int>> &matrix, int n, int m)
{


for (int i = 0; i < n; i++)
{
DFS_jump(matrix, i, 0, n, m);




}
if (min_dist == 1000000)
return -1;
else
return min_dist;






}


/******************************结束写代码******************************/


int main() {
int n, m;
cin >> n >> m;
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');


vector<vector<int>> matrix;
for (int i = 0; i < n; i++) {
vector<int> row;
for (int j = 0; j < m; j++) {
int e;
cin >> e;
row.push_back(e);
}


matrix.push_back(row);
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
}


cout << jump(matrix, 3, 5) << endl;


return 0;
}