1204. Maze Traversal

1204.   Maze Traversal

A common problem in artificial intelligence is negotiation of a maze. A maze has corridors and walls. The robot can proceed along corridors, but cannot go through walls.

Input

For this problem, you will input the dimensions of a maze, as two integer
values on the first line. Of the two numbers, the first is the number of rows
and the second is the number of columns. Neither the number of rows nor columns
will exceed 60.

Following these numbers will be a number of rows, as specified previously. In
each row there will be a character for each column, with the tow terminated by
the end of line. Blank spaces are corridors, asterisks are walls. There needn't
be any exits from the maze.

Following the maze, will be an initial row and column specified as two
integers on one line. This gives the initial position of the robot. Initially
the robot will be facing North (toward the first row).

The remaining input will consist of commands to the robot, with any amount of
interspersed white-space. The valid commands are:

R rotate the robot 90 degrees clockwise (to the right)
L rotate the robot
90 degrees counter-clockwise (to the left)
F move the robot forward unless a
wall prevents this in which case do nothing
Q quite the program, printing out
the current robot row, column and orientation.

Output

The final row and column must be integers separated by a space. The
orientation must be one of N, W, S, E and separated from the column by a
space.

Sample Input

7 8
********
* * * **
* *    *
* * ** *
* * *  *
*   * **
********
2 4
RRFLFF FFR
FF
RFFQ

Sample Output

5 6 W

特别注意：
1、输入的行列号数跟数组内的下标数差一位，一定要注意转换。
2、读入字符串，特别是带有空白字符的字符串，一定还要注意回车符。
3、最后一定要注意输出最后一定要有一个回车符，不然会是PE错误，也就是输出格式错误。
printf("%d %d %c\n",robot.row+1,robot.col+1,robot.ori);

 #include <stdio.h>
 #include <string.h> 

 int handle(char *ptr);
 void move(char str);

 struct R{
     int row;//行号
     int col;//列号
     char ori;//朝向
 }robot;
 char maze[][];

 int main(void)
 {
     int row,col,i,j;
     char run[];

     scanf("%d %d",&row,&col);
     getchar();

     for(i=;i<row;i++){
         for(j=;j<col;j++)
             maze[i][j]=getchar();
         getchar();
     }

     scanf("%d %d",&robot.row,&robot.col);
     getchar();//吸收回车
     robot.ori = 'N';
     robot.row--;
     robot.col--;//跟数组匹配。 

     while(){
         gets(run);
         if(handle(run) == )
             break;
         memset(run,,sizeof(run));
     }

     printf("%d %d %c\n",robot.row+,robot.col+,robot.ori);

     //system("PAUSE");
     return ;
 }

 int  handle(char *ptr)
 {
      char *next = ptr;
      char c= *next;
      while((c != '\0')&&(c != 'Q')){
          move(c);
          next++;
          c= *next;
      }
      if(*next == 'Q')
          return ;
      return ;
 }

 void move(char str)
 {
      char s=str;
      if((s == 'R')||(s == 'L')){
          switch(robot.ori){
              case 'N':
                   if(s == 'R')
                       robot.ori = 'E';
                   else
                       robot.ori = 'W';
                   break;
              case 'E':
                   if(s == 'R')
                       robot.ori = 'S';
                   else
                       robot.ori = 'N';
                   break;
              case 'S':
                   if(s == 'R')
                       robot.ori = 'W';
                   else
                       robot.ori = 'E';
                   break;
              case 'W':
                   if(s == 'R')
                       robot.ori = 'N';
                   else
                       robot.ori = 'S';
                   break;
          }
      }
      if(s == 'F'){
          switch(robot.ori){
              case 'N':
                   if(maze[robot.row-][robot.col] == ' ')
                       robot.row--;
                   break;
              case 'E':
                   if(maze[robot.row][robot.col+] == ' ')
                       robot.col++;
                   break;
              case 'S':
                   if(maze[robot.row+][robot.col] == ' ')
                       robot.row++;
                   break;
              case 'W':
                   if(maze[robot.row][robot.col-] == ' ')
                       robot.col--;
                   break;
          }
      }
 }