java蓝桥杯b组

最长子序列

import java.util.Scanner;
// 1:无需package
// 2: 类名必须Main, 不可修改import java.util.Scanner;public class Main11 {public static void main(String[] args) {Scanner scan = new Scanner(System.in);//在此输入您的代码...String str1=scan.next();String str2=scan.next();int b=0;for(int i=0;i<str1.length();i++) {char ch1=str1.charAt(i);char ch2=str2.charAt(b);if(ch1==ch2) b++;}System.out.println(b);scan.close();}
}

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner scan = new Scanner(System.in);//在此输入您的代码...int t=scan.nextInt();for(int i=0;i<t;i++){int A=scan.nextInt();int B=scan.nextInt();int result=A%B;//防止余数为负数，要再加上被除数if(result<0){result+=Math.abs(B);}System.out.println(result);}scan.close();}
}

移动到末尾

import java.util.Scanner;
// 1:无需package
// 2: 类名必须Main, 不可修改public class Main {public static void main(String[] args) {Scanner scan = new Scanner(System.in);//在此输入您的代码...int n=scan.nextInt();int[] arr=new int[n];int a=0;for(int i=0;i<n;i++) {int b=scan.nextInt();if(b!=0) {arr[a]=b;a++;}}for(int i=0;i<n;i++) {System.out.print(arr[i]+" ");}scan.close();}
}