摘要:
程序调用自身的编程技巧称为递归。//汉诺塔的游戏,n为圆盘编号数量,编号,a,b,c代表的是三个柱子var hanio=function(n,a,b,c){ if(n>0){ hanio(n-1,a,c,b); document.writeln('Move n '+n+" form "+a+' to '+c); document.write(""); hanio(n-1,b,a,c) }} hanio(3,'a','b','c')}//Move n 1 form a t 阅读全文
摘要:
var a='start111111endstart222222endasdfasdfasdfakjsfhaksdf'+'start333333endstart444444end66666666666sdfghsdfgsdg'alert(a.match(/start.*?end/img).join("=").replace(/start/g,"").replace(/end/g,"").split("="))结果111111,222222,333333,444444 阅读全文