• C语言(简单游戏)-走出迷宫


     1 #include <stdio.h>
     2 //宏定义 maze[ROWS][COLS];行和列;
     3 #define ROWS 7
     4 #define COLS 6
     5 //绘制迷宫(全局变量)
     6 char maze[ROWS][COLS]= {
     7     {'#','#','#','#','#','#'},
     8     {'#','0','#',' ',' ',' '},
     9     {'#',' ','#',' ','#','#'},
    10     {'#',' ','#',' ',' ','#'},
    11     {'#',' ',' ','#',' ','#'},
    12     {'#','#',' ',' ',' ','#'},
    13     {'#','#','#','#','#','#'}
    14 };
    15 //设置X,Y坐标(全局变量);
    16 int currentX=1,currentY=1;
    17 //移动后的XY坐标(全局变量);
    18 int nextX,nextY;
    19 //看下一步是否能走  int[x][y]==' ' ;
    20 char street = ' ';
    21 
    22 //初始化函数
    23 void printMaze();
    24 void moveToNextPosition();
    25 void calculateNextPosition(char direction);
    26 
    27 
    28 
    29 int main(int argc, const char * argv[]) {
    30     nextX = currentX;
    31     nextY = currentY;
    32     //屏幕打印出迷宫;
    33     printMaze();
    34     char direction;
    35     while (1) {
    36         printf("请移动人物,用键盘W/S/A/D(上下左右)操作
    ");
    37         scanf("%c",&direction);
    38         calculateNextPosition(direction);
    39         moveToNextPosition();
    40         printMaze();
    41         if (currentX==ROWS-1||currentY==COLS-1){
    42             printf("通关了,呵呵!");
    43             break;
    44         }
    45     }
    46     return 0;
    47 }
    48 
    49 
    50 //打印地图
    51 void printMaze(){
    52     for(int i = 0;i<ROWS;i++){
    53         for (int j = 0;j<COLS;j++) {
    54             printf("%c",maze[i][j]);
    55         }
    56         printf("
    ");
    57     }
    58 }
    59 //移动人物
    60 void moveToNextPosition(){
    61     if (maze[nextX][nextY]==street) {
    62         char temp = maze[currentX][currentY];
    63         maze[currentX][currentY] = maze[nextX][nextY];
    64         maze[nextX][nextY] = temp;
    65         currentX = nextX;
    66         currentY = nextY;
    67         
    68     }else{
    69         nextX = currentX;
    70         nextY = currentY;
    71     }
    72 }
    73 //计算下一个位置
    74 void calculateNextPosition(char direction){
    75     switch (direction) {
    76         case 'w':{
    77             nextX = currentX - 1;
    78             break;
    79         }
    80         case 's':{
    81             nextX = currentX + 1;
    82             break;
    83         }
    84         case 'a':{
    85             nextY = currentY - 1;
    86             break;
    87         }
    88         case 'd':{
    89             nextY = currentY + 1;
    90             break;
    91         }
    92         default:
    93             break;
    94     }
    95 }
  • 相关阅读:
    Androidstudio 使用git插件提交代码
    androidstudio上传代码到git上
    tcpdump的简单使用
    使用nmap工具查询局域网某个网段正在使用的ip地址
    网段的划分
    jenkins配置源码管理git
    shell条件测试test
    shell简单用法笔记(shell中数值运算)二
    shell简单用法笔记(一)
    如何解决audiodg占用内存高(停止与重启audiodg服务)
  • 原文地址:https://www.cnblogs.com/glchan/p/4814992.html
Copyright © 2020-2023  润新知