1.金字塔
package com.sfj.test;
import java.util.Scanner;public class JZT
{
public void setJZT()
{
Scanner input=new Scanner(System.in);
int cengshu=input.nextInt();
int i;
for(i=0;i<cengshu;i++)
{
for(int j=0;j<(2*cengshu+1); j++)
{
if((j<cengshu-i-1) || (j>=cengshu+i))
{
System.out.print(" ");
}else
{//控制打印*号
System.out.print("*");
}
}
System.out.println();
}
}
public static void main(String args[]) {
// TODO Auto-generated method stub
JZT jzt = new JZT();
jzt.setJZT();
}
}
2.乘法表
package com.sfj.test;
import java.util.Scanner;
public class Cfb {
public void getCfb(){
Scanner input=new Scanner(System.in);
int shuru=input.nextInt();
// TODO Auto-generated method stub
for(int i=1;i<=shuru;i++)
{
for(int j=1;j<=i;j++)
{
int k=i*j;
System.out.print(i+"*"+j+"="+k+"\t");
}
System.out.println();
}
System.out.println();
}
public static void main(String args[]){
Cfb c=new Cfb();
c.getCfb();
}
}
3.数组置换
package com.sfj.test;import java.util.Scanner;
public class SZ
{
public void setSZ()
{
Scanner input=new Scanner(System.in);
System.out.println("数组的阶层为:");
int n=input.nextInt();
System.out.println("按顺序输入数组元素:");
int arr[][]=new int [n][n];
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
arr[i][j]=input.nextInt();
}
}
System.out.println("原数组为:");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(arr[i][j]+" ");
if(j==n-1)
System.out.println();
}
}
System.out.println("置换后数组为:");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(arr[j][i]+" ");
if(j==n-1)
System.out.println();
}
}
}
public static void main(String args[])
{
SZ sz=new SZ();
sz.setSZ();
}
}
运行结果