题目:2816. 判断子序列 - AcWing题库
代码实现:
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] a = new int[n];
int[] b = new int[m];
for (int i = 0; i < n; i++) a[i] = sc.nextInt();
for (int i = 0; i < m; i++) b[i] = sc.nextInt();
int i = 0, j = 0;
while (i < n && j < m) {
if (a[i] == b[j]) {
i++;
}
j++;
}
// for (;j < m && i < n; j++) {
// if (a[i] == b[j]) {
// i++;
// }
// }
if (i == n) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}