AcWing 2816. 判断子序列(Java 版本)
原题链接
简单
作者:
恒心
,
2021-01-25 11:35:15
,
所有人可见
,
阅读 295
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args) throws Exception{
int N = 100010;
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] a = new int[N];
int[] b = new int[N];
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(j < m){
if(a[i] == b[j]){i++;}
j++;
}
if(i == n){
System.out.println("Yes");
}else{
System.out.println("No");
}
}
}