F.R.I.D.A.Y.

Q. 2018/05/13 - [프로그래밍/C C++] - Q 길찾기 > 1순위"); } printf("\n"); } DestroyNode(root); free(end); free(list); return 0; } void findNode(Node *parent, Pos *start, Pos *end) { if (bg[start->x][start->y]) { Pos *Nxt = (Pos *)malloc(sizeof(Pos)); if (start->x + 1 x) { if (bg[start->x + 1][start->y]) { Nxt->x = start->x + 1; Nxt->y = start->y; parent->xNode = setNode(bg[Nxt->x][Nxt->y], Nxt); parent->xN..

Q. (이미지 문제) 배열 코드 { 8,9,5,4,3,8,6,3,2,0 } ,{ 3,0,0,0,2,0,0,0,1,0 } ,{ 2,0,0,0,5,0,0,0,5,0 },{ 3,1,5,0,4,0,0,0,7,0 } ,{ 0,0,7,0,2,0,0,0,3,0 } ,{ 0,0,3,0,1,0,0,0,2,9 },{ 0,0,2,0,1,9,5,0,0,3 } ,{ 0,0,2,0,0,0,4,3,0,1 } ,{ 0,0,1,0,0,0,0,8,0,8 } ,{ 0,0,5,8,6,3,2,2,6,6 }