양씨 행렬에서 찾은 JS 코드

 
  
 
  
 
  
 
  
 
  
 
  
 
  
 
  
 
  <br>function xunhuan() 
  <br>{ 
  <br>var m = parseInt(document.getElementsByTagName("input")[0].value)||document.getElementsByTagName("input")[0].getAttribute("value"); 
  <br>var n = parseInt(document.getElementsByTagName("input")[1].value)||document.getElementsByTagName("input")[1].getAttribute("value"); 
  <br>var t = parseInt(document.getElementsByTagName("input")[2].value)||document.getElementsByTagName("input")[2].getAttribute("value"); 
  <br>    if(m >= 1&&n <= 1000&&t >= 1&&t <= 1000000) 
  <br>    { 
  <br>        var num = 2; 
  <br>        for(var x = 0;x < m;x++) 
  <br>        { 
  <br>            for(var y = 0;y < n;y++) 
  <br>            { 
  <br>                document.write((num++)+" "); 
  <br>            } 
  <br>            document.write("<br/>"); 
  <br>        } 
  <br>        var a=new Array(); 
  <br>        for(var e = m*n+1;e > 1; e--) 
  <br>        { 
  <br>            a.splice(0,0,e) 
  <br>        } 
  <br>        chazhao(a,t); 
  <br>    } 
  <br>    else 
  <br>    { 
  <br>        alert("     ，     "); 
  <br>    } 
  <br>} 
  <br>function chazhao(a,number) 
  <br>{ 
  <br>    document.write(isCon(a, number)); 
  <br>    function isCon(a, number) 
  <br>    { 
  <br>        for(var i=0; i<a.length; i++) 
  <br>        { 
  <br>            if(a[i] === number) 
  <br>            { 
  <br>                return String(true); 
  <br>            } 
  <br>        } 
  <br>        return String(false); 
  <br>    } 
  <br>} 
  <br> 
  
 
  
    ：     ：
 
  
    ：