javaScript实现等腰的杨辉三角

<html xmlns="http://www.w3.org/1999/xhtml">

	<style>
		div {text-align:center;}
		span {margin-right:10px;}
	</style>

<body>
<script type="text/javascript">
	var n = 20 ;
	var aArr = new Array();
	var aDiv = new Array();
	var aSpan = new Array();
	for (var i = 0; i < n; i++) {
		aArr[i] = new Array();
		aDiv[i] = document.createElement("div");
		for(var j = 0 ; j<=i ;j++){
			if(j==0||j==i)
				aArr[i][j] = 1;
			else
				aArr[i][j] = aArr[i-1][j-1]+aArr[i-1][j]
			
			aSpan[j] = document.createElement("span")
			aSpan[j].appendChild(document.createTextNode(aArr[i][j]))
			aDiv[i].appendChild(aSpan[j])
		}
		document.body.appendChild(aDiv[i]);
 	}

</script>
</body>

</html>

 

おすすめ

転載: blog.csdn.net/Chen_leilei/article/details/111251902