[問題] 蜂巢陣列的走迷宮
程式碼 http://nopaste.csie.org/1a0a1
讀檔.txt http://shouryan.myweb.hinet.net/maze.txt
題目 http://shouryan.myweb.hinet.net/hw2_pg.pdf
蜂巢陣列的走迷宮(只有奇數奇數&偶數偶數座標)
以下是我遞迴判斷的函式
因為我沒有建立迷宮的牆壁
所以多一層if判斷是否超出map
請問可否這樣寫?
為何走不到終點ˊˋ
if(j-2>=0) //用來讓他不要超出map大小
if(map[i][j-2] == 1||map[i][j-2] == 3) //題目預設終點值=3
visit(map, i, j-2);
if(i+1<=map_row-1 && j-1>=0)
if(map[i+1][j-1] == 1||map[i+1][j-1] == 3)
visit(map, i+1, j-1);
if(i+1<=map_row-1 && j+1<=map_col-1)
if(map[i+1][j+1] == 1||map[i+1][j+1] == 3)
visit(map, i+1, j+1);
if(j+2<=map_col-1)
if(map[i][j+2] == 1||map[i][j+2] == 3)
visit(map, i, j+2);
if(i-1>=0 && j+1<=map_col-1)
if(map[i-1][j+1] == 1||map[i-1][j+1] == 3)
visit(map, i-1, j+1);
if(i-1>=0 && j-1>=0)
if(map[i-1][j-1] == 1||map[i-1][j-1] == 3)
visit(map, i-1, j-1);
開發平台： (例: VC++ or gcc/g++ or Dev-C++, Windows or Linux)
VC++6.0
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.121.212.131
推
05/26 06:25, , 1F
05/26 06:25, 1F
推
05/26 10:22, , 2F
05/26 10:22, 2F
→
05/26 13:12, , 3F
05/26 13:12, 3F
→
05/26 13:20, , 4F
05/26 13:20, 4F
→
05/26 13:46, , 5F
05/26 13:46, 5F
→
05/26 13:52, , 6F
05/26 13:52, 6F
→
05/26 15:15, , 7F
05/26 15:15, 7F
C_and_CPP 近期熱門文章
PTT數位生活區 即時熱門文章
-4
5