zoukankan      html  css  js  c++  java
  • js小游戏

    var maps = [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
               [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]];
    
    var role = [3, 4];
    
    function up(action){
      
      if(action == 1) role[1]--;
      if(action == 2) role[0]--;
      if(action == 3) role[1]++;
      if(action == 4) role[0]++;
      
      var tmp = '';
      console.clear();
    
    for(var i = 0; i < maps.length; i++){
      
      tmp = '';
      for(var j = 0; j < maps[i].length; j++){
        
        if(role[0] == i && role[1] == j){
          
          tmp += '* ';
          
        }else {
          
          tmp += maps[i][j] + ' ';     
          
        }
        
      }
      console.log(tmp);
      
    }
      
    }
    
    
    document.onkeydown=function(event){
      var e = event || window.event || arguments.callee.caller.arguments[0];
      
      if(e && e.keyCode==37){ //
        up(1);
      }
      if(e && e.keyCode==38){ //
        up(2);
      }            
      if(e && e.keyCode==39){ //
        up(3);
      }            
      if(e && e.keyCode==40){ //
        up(4);
      }
      
    }; 
  • 相关阅读:
    codevs 2833 奇怪的梦境
    codevs 3058 寻找sb5
    codevs 2989 寻找somebody
    并查集
    排列组合
    序章
    [POJ2625][UVA10288]Coupons
    2017NOIP模拟赛-科普基地
    AIM Tech Round 5 (rated, Div. 1 + Div. 2)
    浙江十套
  • 原文地址:https://www.cnblogs.com/jh1994/p/9248163.html
Copyright © 2011-2022 走看看