题解 | #查找#

//输入数组长度 n 输入数组      a[1...n] 输入查找个数m 输入查找数字b[1...m]
//输出 YES or NO  查找有则YES 否则NO 。
#include <stdio.h>
#include <string.h>
int main() {
    int n;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    int k;
    scanf("%d", &k);
    int b[k];
    for (int i = 0; i < k; i++) {
        scanf("%d", &b[i]);
    }

    for (int i = 0; i < k; i++) {
        int count = 0;
        for (int j = 0; j < n; j++) {
            if (b[i] == a[j]) {
                printf("YES\n");
                break;
            }
            count++;
        }
        if (count == n) {
            printf("NO\n");
        }

    }
}