acwing 2816. Judgement subsequence

Given a length of n Integer sequence of a1,a2,…,an And a length of m Integer sequence of b1,b2,…,bm.

Please judge a Whether the sequence is b Subsequences of sequences .

Subsequence refers to the sequence obtained by arranging some items of the sequence in the original order , For example, the sequence {a1,a3,a5} It's a sequence {a1,a2,a3,a4,a5} A subsequence of .

Input format
The first line contains two integers n,m.

The second line contains n It's an integer , Express a1,a2,…,an.

The third line contains m It's an integer , Express b1,b2,…,bm.

Output format
If a Sequence is b Subsequences of sequences , Output one line Yes.

otherwise , Output No.

Data range
1≤n≤m≤105,
−109≤ai,bi≤109
sample input ：
3 5
1 3 5
1 2 3 4 5
sample output ：
Yes

Double pointer algorithm ： It's easy to think of .

code:

#include <iostream>

using namespace std;

const int N = 100010;
int n, m; 
int a[N], b[N];

int main()
{
    
    cin >> n >> m;
    for(int i =0 ;i < n; i ++) cin >> a[i];
    for(int i =0; i < m; i ++) cin >> b[i];
    
    int i = 0, j = 0;
    while(i < n && j < m)
    {
    
        if(a[i] == b[j])  i ++;
        j ++;
    }
    if(i == n) cout << "Yes";
    else cout << "No";
    return 0;
}

 Or write like this 
#include <iostream>

using namespace std;

const int N = 100010;
int n, m; 
int a[N], b[N];

int main()
{
    
    cin >> n >> m;
    for(int i =0 ;i < n; i ++) cin >> a[i];
    for(int i =0; i < m; i ++) cin >> b[i];
    
    int j = 0;
    for(int i = 0; i < m && j < n; i ++)
    {
    
        if(a[j] == b[i])  j ++;
    }
    //cout << j << endl;
    if(j == n ) cout << "Yes";
    else cout << "No";
    return 0;
}