<html>
<head>
<meta http-equiv=content-type content="text/html;charset=GBK">
<script> var students = ["A", "B", "C", "D", "E", "F", "G", "S", "T", "U", "V", "W", "X","Y", "Z"]; // 做了一个自定义的堆栈,来实现顺序显示
var stack = {tags : [document.createElement("h5"),
document.createElement("h4"),
document.createElement("h3"),
document.createElement("h2"),
document.createElement("h1"),
document.createElement("h2"),
document.createElement("h3"),
document.createElement("h4"),
document.createElement("h5")],
data : ["", "", "", "", "", "", "", "", ""],
push : function(text){
this.data.shift();
this.data.push(text);
for(var i=0; i<this.tags.length; i++){
this.tags[i].innerHTML = this.data[i];
} } }; </script>
</head>
<body> </body>
<script>
var tags = stack.tags;
for(var j=0; j<tags.length; j++) document.body.appendChild(tags[j]); // 每一秒显示一个姓名
function func(){
var index = 0;
var len = students.length;
var timer = setInterval(function(){
if(index<len) { stack.push(students[index]); index=index+1;} else { index=1;stack.push(students[index-1]);} }, 1000); }
func(); </script>
<script>
// var tags = stack.tags;
// for(var j=0; j<tags.length; j++) document.body.appendChild(tags[j]); // 每一秒显示一个姓名
//
//function func(){
//var index = 0;
////var len = students.length*2;
//var timer = setInterval(function(){ var text = students[index++];// 如果达到最后一个姓名,则停止循环
////if(text) { stack.push(text); } else { clearInterval(timer); return false; } }, 100); }
//if(text) { stack.push(text); } else { var text1 = students[index--];} }, 100); }
//func(); </script>
</html>





