jsp打印杨辉三角

最新推荐文章于 2023-01-19 21:36:12 发布

oliver233

最新推荐文章于 2023-01-19 21:36:12 发布

阅读量1.4k

点赞数

分类专栏：习题练习

本文链接：https://blog.csdn.net/oliver233/article/details/52539803

版权

习题练习专栏收录该内容

39 篇文章 0 订阅

订阅专栏

<%@ page language="java" import="java.util.*" pageEncoding="utf-8"%>
<%
String path = request.getContextPath();
String basePath = request.getScheme()+"://"+request.getServerName()+":"+request.getServerPort()+path+"/";
%>

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
  <head>
    <base href="<%=basePath%>">
    
    <title>My JSP 'index.jsp' starting page</title>
	<meta http-equiv="pragma" content="no-cache">
	<meta http-equiv="cache-control" content="no-cache">
	<meta http-equiv="expires" content="0">    
	<meta http-equiv="keywords" content="keyword1,keyword2,keyword3">
	<meta http-equiv="description" content="This is my page">
	<!--
	<link rel="stylesheet" type="text/css" href="styles.css">
	-->
  </head>
  
  <body>
    	<h1>利用jsp打印杨辉三角 </h1><br>
    	<%int a[][]=new int[10][10]; %>
    	<%!
    		public void write(int a[][])
    		{
    			 	
					  for (int i=0;i<a.length ;i++ )
					  {
					   	for (int j=0;j<a[i].length ;j++ )
					   {
						    if (j==0||i==j)
						    {
						       a[i][j]=1;
						    }
					     else{
					      if (i>j)
						      {
						       a[i][j]=a[i-1][j]+a[i-1][j-1];
						      }
					       }
					      }
  					}
  			}
   		%>
   		<%write(a); %>
   				
   		<%
   			 for (int i=0;i<a.length ;i++ )
  				{
				   for (int j=0;j<a[i].length ;j++ )
				   {
				     if (i>=j)
				     {
		 %>
		 <%=a[i][j]+"\t" %>
		 <%
				     }
				   }
		%>
				<br>
		<%
				         
			}
			
   		 %>
  </body>
</html>

oliver233

关注

0
点赞
踩
2

收藏

觉得还不错? 一键收藏
0
评论
jsp打印杨辉三角

<%String path = request.getContextPath();String basePath = request.getScheme()+"://"+request.getServerName()+":"+request.getServerPort()+path+"/";%> "> My JSP 'index.jsp' startin
复制链接

扫一扫