一,乘法表
@Test
public void 乘法表()
{
for(int m = 1,n = 1; n <= 9; m++) {
System.out.print(m + "*" + n + "=" + m*n + " ");
if(m == n) {
m = 0;
n++;
System.out.println();
}
}
运行结果:
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
1*5=5 2*5=10 3*5=15 4*5=20 5*5=25
1*6=6 2*6=12 3*6=18 4*6=24 5*6=30 6*6=36
1*7=7 2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49
1*8=8 2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64
1*9=9 2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81
二,杨辉三角
@Test
public void 杨辉三角() {
int num = 10;
int[][] arr = new int[num][num];
for(int r = 0, c = 0; c < num; c++) {
if(c == 0) {
arr[r][c] = 1;
System.out.print(arr[r][c] + " ");
} else if(r != 0) {
arr[r][c] = arr[r-1][c-1] + arr[r-1][c];
System.out.print(arr[r][c] + " ");
}
if(r == c) {
r++;
c = -1;
System.out.println();
}
}
}
运行结果:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1