杨辉三角 int[][] arr=new int[10][10]; arr[0][0]=1; arr[1][0]=1; arr[1][1]=1; for (int i = 2; i<arr.length; i++){ for (int j = 0; j<arr.length; j++){ if((i==j)||(j==0)){ arr[i][j]=1; }else{ arr[i][j]=arr[i-1][j-1]+arr[i-1][j]; } } } for (int i = 0; i<arr.length; i++){ for (int j = 0; j<arr.length; j++){ if(arr[i][j]!=0){ System.out.print (arr[i][j]+"\t"); } } System.out.println (); } }
直角三角形
int i=0; for(int j=1;j<=10;j++) { int temp=i; for(int k=j;k<=10;k++) {while(temp>0){temp--;System.out.print(" "); }System.out.print("*"); }System.out.println(); //i++;}
等腰三角形int i=0; for(int j=1;j<=10-i;j++) { int temp=i; for(int k=j;k<=10-j;k++) { while(temp>0) { temp--; System.out.print(" "); }System.out.print("*"); }System.out.println(); i++; }
平行四边形
int row = 9; for (int i = 1; i<=row; i++){ for (int j =1 ; j<=row-i; j++){ System.out.print (" "); } for (int k = 1; k<=row*2-1; k++){ System.out.print ("*"); } System.out.println (); } }
打印杨辉三角,三角形,四边形
最新推荐文章于 2022-01-05 11:57:16 发布