1.求两个数的最小值
import java.util.*;
import static java.lang.Integer.min;
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
System.out.println("请输入两个整数: ");
int a = scanner.nextInt();
int b = scanner.nextInt();
int result = min(a,b);
System.out.println(result);
}
public static int main(int a,int b){
if (a<b){
return a;
}
return b;
}
2.打印1000到2000之间的闰年
public static void main(String[] args){
printAllLeapYear(1000,2000);
}
public static void printAllLeapYear(int began,int end){
for(int year=began;year<=end;year++){
if(isLeapYear(year)){
System.out.println(year);
}
}
}
public static boolean isLeapYear(int year){
//世纪闰年
if (year%100==0){
if(year%400==0){
return true;
}
return false;
}else {
//普通闰年
if(year%4==0){
return true;
}
return false;
}
}
结果太多省略了部分
3. 打印1~100之间的素数
public static void main(String[] args){
printAllPrime(1,100);
}
public static void printAllPrime(int began,int end){
for(int i=began;i<=end;i++){
if(isPrime(i)){
System.out.println(i);
}
}
}
public static boolean isPrime(int num){
if(num==1){
return false;
}
for(int i=2;i<num;i++){
if(num%i==0){
return false;
}
}
return true;
}
同样结果太多,省略了部分~
4.打印九九乘法表
public static void main(String[] args){
printMT();
}
public static void printMT(){
for(int row=1;row<=9;row++){
printLine(row);
}
}
public static void printLine(int row){
for(int col=1;col<=row;col++){
System.out.print(col+"x"+row+"="+col*row+" ");
}
System.out.println();
}
5.求两个正整数的最大公约数
public static void main(String[] args){
int result = caclGCD(100,120);
System.out.println(result);
}
public static int caclGCD(int a,int b){
int min=min(a,b);
for(int i=min;i>=1;i--){
if(a%i==0&&b%i==0){
return i;
}
}
return 1;
}
6.在1-100之间找出含有9的个数
public static void main(String[] args){
int count = caclNineCount(1,100);
System.out.println(count);
}
public static int caclNineCount(int began,int end) {
int count = 0;
for (int i = began; i <= end; i++) {
count += caclCurrentNineCount(i);
}
return count;
}
public static int caclCurrentNineCount ( int num){
int count = 0;
int ge = num % 10;
if (ge == 9) {
count++;
}
int shi = num / 10 % 10;
if (shi == 9) {
count++;
}
return count;
}