Hash初步(空间换时间的策略)

#include<cstdio>

int main(){
    int arr[N] = {7,8,2,4};
    int brr[M] = {8,2};
    for(int i=0;i < N;++i){
        if(int j=0;j < M;++i){
            if(arr[i] == brr[j]){
                printf("brr[%d] == arr[%d]\n",j,i);
            }
        }
    }
}

//hash.c
#include<cstdio>
#define bool int
#define false 0
#define true 1
const int MAX = 10000;
bool HashTable[MAX] = {false};
int main(){
    int arr[] = {7,8,2,4};
    int N = sizeof(arr)/sizeof(arr[0]);
    int brr[] = {8,2};
    int M = sizeof(brr)/sizeof(brr[0]);
    for(int i=0;i < M:++i){
        HashTable[arr[i]] = true;
    }
    for(int j=0;j < N;++j){
        if(HashTable[brr[j]] == true){
            printf("%d 出现过!\n",brr[j]);
        }
    }
    return 0;
}