迷宫问题设计小结

1/3迷宫问题设计小结思路1）双向链表存储，走过路径；2）递归调用CHARSHORTEST_PATHPOSITIONCURRRENTPOS,POSITIONDESPOS实现查找递归调用CHARSHORTEST_PATH的返回情况1在该节点，尝试过右、下、左、上四个方向，都无法走通，该节点是条死路，则RETURNN回退到上一节点，在上一节点寻找其他可走的路；2已经到达目的地DESPOS，RETURNY递归返回Y，直到第一次调用CHARSHORTEST_PATH之后，结束递归调用；15INT_X/行6INT_Y/列7POSITION/节点坐标信息，保存路径89TYPEDEFSTRUCT_NODE10POSITION_POS11STRUCT_NODENEXT12STRUCT_NODEPRE13NODE1415TYPEDEFSTRUCT16NODEHEAD17NODETAIL18PATH/路径的HEAD、TAIL，访问路径1920INTMAZE55210,1,0,0,0,220,1,1,1,0,230,0,0,0,0,240,1,0,1,1,250,1,0,0,0,262728INTOFFSET42290,1,301,0,310,1,321,0,33/右、下、左、上3435PATHPATH/路径2/33637VOIDSTEP_FORWARDINTPOS_X,INTPOS_Y/前进3839NODENODENODEMALLOCSIZEOFNODE40IFNODENULL4142NODE_POS_XPOS_X43NODE_POS_YPOS_Y44NODEPRENULL45NODENEXTNULL46IFNULL47NODE49NODEPRENODE51MAZENODE_POS_XNODE_POS_OIDSTEP_BACKFORWARD5758IFNULL5960NODENEWTAILNULL62FREENEWTAIL646566CHARIS_CAN_GOINTPOS_X,INTPOS_Y6768IFPOS_X0|POS_X469|POS_Y0|POS_Y470|MAZEPOS_XPOS_Y071RETURNN/跃出地图边界，或者是墙，或者是死路，返回N72/IFNULL_POS_XPOS_POS_YPOS_Y73/RETURNN/方向是返回的方向，返回N74RETURNY/其他返回Y757677CHARSHORTEST_PATHPOSITIONCURRENTPOS,POSITIONDESPOS7879INTI80IFCURRENTPOS_XDESPOS_XCURRENTPOS_YDESPOS_Y/如果已经到达目的地，回退81RETURNY82FORI0II8384INTNEWPOS_XCURRENTPOS_XOFFSETI085INTNEWPOS_YCURRENTPOS_YOFFSETI186IFIS_CAN_GONEWPOS_X,NEWPOS_YY/如果当前位置，可以移动，则移动方格3/38788STEP_FORWARDNEWPOS_X,NEWPOS_Y89CURRENTPOS_XNEWPOS_X90CURRENTPOS_YNEWPOS_Y91IFYSHORTEST_PATHCURRENTPOS,DESPOS/已经到达终点，则返回Y92RETURNY93ELSE/否则，回退9495STEP_BACKFORWARD96CURRENTPOS_X_POS_X97CURRENTPOS_Y_POS_Y9899100101RETURNN102103104VOIDINITIALIZE105NODEMALLOCSIZEOFNODENULLNULL_POS_X0_POS_Y0112MAZE001113114115VOIDPRINT_PATH116117NODENODE_PTR118NODE_PTR119WHILENODE_PTRNULL120121PRINTFD,DN,NODE_PTR_POS_X,NODE_PTR_POS_Y122NODE_PTRNODE_PTRNEXT123124125126INTMAIN127128POSITIONCURRENTPOS129POSITIONDESPOS130INITIALIZE131132CURRENTPOSPOSITIONMALLOCSIZEOFPOSITION133CURRENTPOS_X0134CURRENTPOS_Y0135136DESPOSPOSITIONMALLOCSIZEOFPOSITION