zoukankan      html  css  js  c++  java
  • 09.17,二维数组,地图

      string[,] erwei = new string[10, 10] 
                {
                    { "","","","","","","","","",""}, 
                    { "","  ","  ","  ","  ","  ","","  ","  ",""}, 
                    { "","  ","","","","  ","","","  ",""},
                    { "","  ","","  ","","  ","  ","","  ",""},
                    { "","  ","","  ","","","  ","","  ",""},
                    { "","  ","","  ","  ","","","","  ",""},
                    { "","  ","","  ","  ","  ","  ","  ","  ",""},
                    { "","  ","  ","  ","","","","  ","",""},
                    { "","  ","","  ","  ","","  ","  ","  ",""},
                    { "","","","","","","","","","" } 
                };
    
                int reny = 4;
                int renx = 6;
                erwei[reny, renx] = "";
    
                while (true)
                {
                   
                    for (int j = 0; j < 10; j++)
                    {
                        for (int i = 0; i < 10; i++)
                        {
                            Console.Write(erwei[j, i]);
                        }
                        Console.Write("
    ");
                    }
    
                    erwei[reny, renx] = "  ";
                    Console.Write("请按wasd来运动:");
                    string caozuo = Console.ReadLine();
                    if (caozuo == "w")
                    {
                        if (erwei[reny - 1, renx] == "  ")
                        {
                            reny = reny - 1;
                        }
                    }
                    if (caozuo == "a")
                    {
                        if (erwei[reny, renx - 1] == "  ")
                        {
                            renx = renx - 1;
                        }
                    }
                    if (caozuo == "s")
                    {
                        if (erwei[reny + 1, renx] == "  ")
                        {
                            reny = reny + 1;
                        }
                    }
                    if (caozuo == "d")
                    {
                        if (erwei[reny, renx + 1] == "  ")
                        {
                            renx = renx + 1;
                        }
                    }
    
                    erwei[reny, renx] = "";
                    Console.Clear();
                }
                Console.ReadLine();
  • 相关阅读:
    家庭问题(family)
    BFS简单题记
    【例2-3】围圈报数
    【例8.3】最少步数
    【例3-5】扩展二叉树
    股票买卖
    小球(drop)
    用循环单链表实现约瑟夫环
    二叉树的3种遍历6种实现
    const与#define宏常量 , inline与#define
  • 原文地址:https://www.cnblogs.com/cf924823/p/4816380.html
Copyright © 2011-2022 走看看