2027.统计元音
实现代码:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
while(s.hasNext()) {
int n = s.nextInt();
String w = s.nextLine();
int q = 0;
while(n--> 0) {
w = s.nextLine();
int a = 0,b = 0,c = 0,d = 0,e = 0;
for (int i = 0; i < w.length(); i++) {
if(w.charAt(i)=='a') {
a=a+1;
}else if(w.charAt(i)=='e') {
b=b+1;
}else if(w.charAt(i)=='i') {
c=c+1;
}else if(w.charAt(i)=='o') {
d=d+1;
}else if(w.charAt(i)=='u') {
e=e+1;
}
}
if(q != 0) {
System.out.println();
}
System.out.println("a:"+a);
System.out.println("e:"+b);
System.out.println("i:"+c);
System.out.println("o:"+d);
System.out.println("u:"+e);
q++;
}
}
}
}
注意:每两个输出样例之间有空行
2028.Lowest Common Multiple Plus![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/ce13d988dd48d9fae46d9021fc050718.jpeg)
实现代码:
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()){
int n = sc.nextInt(); //正整数个数
int[] arr = new int[n]; //存放正整数
int count = 0; //记录能整除数的个数
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
Arrays.sort(arr); //sort方法:实现对数组的排序
int max = arr[n-1];
Star:for (int i = max;; i++) {
count = 0;
for (int j = 0; j < n; j++) {
if(i % arr[j] == 0) {
count++;
}else{
break;
}
}
if(count == n) {
System.out.println(i);
break Star;
}
}
}
}
}
如果只写break,就只能跳出一层for循环;如果想跳出两层for循环的话,在外层for循环前加上一个标识,然后用“break 标识;”的写法就可以跳出外层for循环。
标识不一定要写Star,outer等其他非关键字都可。