AcWing 2816. 判断子序列
原题链接
简单
作者:
Ceadmon
,
2022-07-12 14:53:19
,
所有人可见
,
阅读 115
代码
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), m = in.nextInt();
int[] a = new int[n];
int[] b = new int[m];
for (int i = 0; i < a.length; i++) a[i] = in.nextInt();
for (int i = 0; i < b.length; i++) b[i] = in.nextInt();
int i=0,j=0;
while (i<m && j<n){
if (a[j]==b[i]) j++;
i++;
}
if (j==n){
System.out.println("Yes");
}else {
System.out.println("No");
}
}
}