backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 10:33:10 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
Backtracking/Rat_maze.cpp
View File

@@ -11,64 +11,63 @@
using namespace std;
int solveMaze(int currposrow,int currposcol,int maze[size][size],int soln[size][size])
int solveMaze(int currposrow, int currposcol, int maze[size][size], int soln[size][size])
{
if((currposrow==size-1) && (currposcol==size-1))
if ((currposrow == size - 1) && (currposcol == size - 1))
{
soln[currposrow][currposcol]=1;
for(int i=0;i<size;++i)
soln[currposrow][currposcol] = 1;
for (int i = 0; i < size; ++i)
{
for (int j=0;j<size;++j)
for (int j = 0; j < size; ++j)
{
cout<<soln[i][j];
cout << soln[i][j];
}
cout<<endl;
cout << endl;
}
return 1;
}
else
{
soln[currposrow][currposcol]=1;
soln[currposrow][currposcol] = 1;
// if there exist a solution by moving one step ahead in a collumn
if((currposcol<size-1) && maze[currposrow][currposcol+1]==1 && solveMaze(currposrow,currposcol+1,maze,soln))
if ((currposcol < size - 1) && maze[currposrow][currposcol + 1] == 1 && solveMaze(currposrow, currposcol + 1, maze, soln))
{
return 1;
}
// if there exists a solution by moving one step ahead in a row
if((currposrow<size-1) && maze[currposrow+1][currposcol]==1 && solveMaze(currposrow+1,currposcol,maze,soln))
if ((currposrow < size - 1) && maze[currposrow + 1][currposcol] == 1 && solveMaze(currposrow + 1, currposcol, maze, soln))
{
return 1;
}
// the backtracking part
soln[currposrow][currposcol]=0;
soln[currposrow][currposcol] = 0;
return 0;
}
}
int main(int argc, char const *argv[])
{
int maze[size][size]={
{1,0,1,0},
{1,0,1,1},
{1,0,0,1},
{1,1,1,1}
};
int maze[size][size] = {
{1, 0, 1, 0},
{1, 0, 1, 1},
{1, 0, 0, 1},
{1, 1, 1, 1}};
int soln[size][size];
for(int i=0;i<size;++i)
for (int i = 0; i < size; ++i)
{
for (int j = 0; j < size; ++j)
{
for (int j=0;j<size;++j)
{
soln[i][j]=0;
}
soln[i][j] = 0;
}
}
int currposrow=0;
int currposcol=0;
solveMaze(currposrow,currposcol,maze,soln);
int currposrow = 0;
int currposcol = 0;
solveMaze(currposrow, currposcol, maze, soln);
return 0;
}