day-1-2-2

一、练习

  • 输出1到100之间被3整除并且能被5整除的所有整数。每行输出6个数字,并输出所有符合条件的累加和
int cc = 0;
int sum = 0;
for (int k = 1; k < 101; k++) {
	System.out.print(k + " ");
	sum += k;
	cc++;
	if (cc % 6 == 0) {
		System.out.println();
	}
}
System.out.println("\n" + sum);
  • 成绩分支分析

    • 使用if-else if-else结构
    Scanner sc=new Scanner(System.in);
    System.out.println("输入学生成绩:");
    int score=sc.nextInt();
    if(score>=90)
        System.out.println("优秀");
    else if(score>=80)
        System.out.println("良好");
    else if(score>=70)
        System.out.println("中等");
    else if(score>=60)
        System.out.println("及格");
    else
        System.out.println("不及格");
    
    • 多个if/else嵌套
    Scanner sc=new Scanner(System.in);
    System.out.println("输入学生成绩:");
    int score=sc.nextInt();
    if(score>=70){
        if(score>=90)
            System.out.println("优秀");
        else{
            if(score>=80)
        		System.out.println("良好");
            else
                System.out.println("中等"); 
        }    
    }else{
        if(score<60)
            System.out.println("不及格");
        else
            System.out.println("及格");
    }
    
    • switch写法
    Scanner sc=new Scanner(System.in);
    System.out.println("输入学生成绩:");
    int score=sc.nextInt();
    switch(score/10){
        case 10:
        case 9:
            System.out.println("优秀");
            break;
        case 8:
            System.out.println("良好");
            break;
        case 7:
            System.out.println("中等"); 
            break;
        case 6:
            System.out.println("及格");
            break;
        default:
            System.out.println("不及格");
            break;
    }
    
  • 杨辉三角形

    • ​ 实心三角形
    Scanner sc = new Scanner(System.in);
    System.out.println("请输入一个行号:");
    int n = 0;
    while (true) {
        n = sc.nextInt();
        if (n >= 1 && n < +Integer.MAX_VALUE / 2) {
            break;
        } else {
            System.out.println("输入不合法!");
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int k = 1; k <= n - i; k++) {
            System.out.print(" ");
        }
        for (int m = 1; m <= i * 2 - 1; m++) {
            System.out.print("*");
        }
        System.out.println();
    }
    sc.close();
    
    • 空心三角形
    int k = 5;
    for (int i = 1; i <= k; i++) {
        for (int m = 1; m <= k - i; m++) {
            System.out.print(" ");
        }
        System.out.print("*");
        int kk = 2 * (i - 1) - 1;
        if (kk > 0) {
            for (int m = 1; m <= kk; m++)
                if (i == k)
                    System.out.print("*");
            else
                System.out.print(" ");
            System.out.print("*");
        }
        System.out.println();
    }
    
  • 菱形

int n = 5;
for (int i = 1; i <= n; i++) {
    for (int k = 1; k <= n - i; k++) {
        System.out.print(" ");
    }
    for (int m = 1; m <= i * 2 - 1; m++) {
        System.out.print("*");
    }
    System.out.println();
}
for (int i = n - 1; i >= 1; i--) {
    for (int k = 1; k <= n - i; k++) {
        System.out.print(" ");
    }
    for (int m = 1; m <= i * 2 - 1; m++) {
        System.out.print("*");
    }
    System.out.println();
}
  • 输入一个数输出他的位数并且逆向输出
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个数");
int num = sc.nextInt();
String ss = "" + num;
System.out.println("他是" + ss.length() + "位数");
for (int i = ss.length() - 1; i >= 0; i--) {
    char cc = ss.charAt(i);
    String sss = "";
    sss += cc;
    System.out.print(sss);
}
}
  • 1,2,3,4四个数字,能组成几个不相等且不重复数字的三位数,都是多少,一行输出三个,并且累加
int tmp = 0;
int num = 0;
int sum = 0;
String ss = "";
for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= 4; j++) {
        for (int k = 1; k <= 4; k++) {
            if (i != j && i != k && j != k) {
                tmp++;
                System.out.print(i + "" + j + "" + k + " ");
                ss += i + "" + j + "" + k + "+";
                if (tmp % 3 == 0) {
                    System.out.println();
                }
                num = Integer.parseInt(i + "" + j + "" + k);
                sum += num;
            }
        }
    }
}
ss = ss.substring(0, ss.length() - 1) + "=";
System.out.print(ss);
System.out.println(sum);
System.out.println("一共有" + tmp + "个");
  • 判断三角形
int a = 3, b = 3, c = 3;
Scanner sc = new Scanner(System.in);
System.out.println("请输入第一个边长:");
while (true) {
a = sc.nextInt();
if (a >= 1 && a < 100)
break;
else
System.out.println("输入的数据不合法!");
}
System.out.println("请输入第二个边长:");
while (true) {
b = sc.nextInt();
if (b >= 1 && b < 100)
break;
else
System.out.println("输入的数据不合法!");
}
System.out.println("请输入第三个边长:");
while (true) {
c = sc.nextInt();
if (c >= 1 && c < 100)
break;
else
System.out.println("输入的数据不合法!");
}
boolean sanjiao = (a + b > c) && (a + c > b) && (b + c > a);
if (sanjiao) {
if (a == b && b == c) {
System.out.println("等边三角形");
} else if (a == b || b == c || a == c) {
System.out.println("等腰三角形");
} else if (a * a + b * b == c * c || a * a + c * c == b * b || b * b + c * c == a * a) {
System.out.println("直角三角形");
} else
System.out.println("普通三角形");
} else {
System.out.println("不是三角形");
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值