代码1
package com.jh;
import java.util.Scanner;
public class JZT {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("请输入金字塔的行数:");
int n = sc.nextInt();
for (int i = 0; i < n; i++)
{
for (int j = 0; j <n-i; j++)
{
System.out.print(" ");
}
for (int k = 0; k < 2*i+1; k++)
{
System.out.print("*");
}
System.out.println();
}
}
}
import java.util.Scanner;
public class JZT {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("请输入金字塔的行数:");
int n = sc.nextInt();
for (int i = 0; i < n; i++)
{
for (int j = 0; j <n-i; j++)
{
System.out.print(" ");
}
for (int k = 0; k < 2*i+1; k++)
{
System.out.print("*");
}
System.out.println();
}
}
}
代码2
package com.jh;
import java.util.Scanner;
public class CFB {
private int number;
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.print("你想看到到哪个数字的乘法表请输入:");
int i,number;
Scanner sc = new Scanner(System.in);
number = sc.nextInt();
for (i = 1; i <= number; i++)
{
for(int n = 1; n <= i; n++)
{
System.out.print( i + "x" + n + "=" + i * n + "\t");
}
System.out.println();
}
private int number;
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.print("你想看到到哪个数字的乘法表请输入:");
int i,number;
Scanner sc = new Scanner(System.in);
number = sc.nextInt();
for (i = 1; i <= number; i++)
{
for(int n = 1; n <= i; n++)
{
System.out.print( i + "x" + n + "=" + i * n + "\t");
}
System.out.println();
}
}
}
代码3
package com.jh;
public class ZZ {
public static void main(String[] args) {
int i,j;
int[][] a = {{1,2,3},{4,5,6},{7,8,9}};
System.out.println("初始矩阵为:\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
System.out.print(a[i][j]+" ");
}
System.out.print("\n");
}
System.out.print("转置矩阵为:\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
System.out.print(a[j][i]+" ");
}
System.out.print("\n");
}
}
public static void main(String[] args) {
int i,j;
int[][] a = {{1,2,3},{4,5,6},{7,8,9}};
System.out.println("初始矩阵为:\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
System.out.print(a[i][j]+" ");
}
System.out.print("\n");
}
System.out.print("转置矩阵为:\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
System.out.print(a[j][i]+" ");
}
System.out.print("\n");
}
}
}