寒假集训——二分查找，哈希查找

表示今天学得很模糊，之前就自己学了二分查找，所以会二分查找，不过今天讲了一个二分查找求上下界的，不明白，网上找了好多代码都是错的。。。

先贴下二分查找代码，模板。。。

int binsearch(int *arr,int low,int high,int key)//二分查找
{
    int mid;
    while(low<=high)
    {
        mid=(low+high)/2;
        if(arr[mid]==key)return mid;
        else if(arr[mid]>key)high=mid-1;
        else low=mid+1;
    }
    return -1;//查找失败返回-1
}

还有二分求上下界的代码

int upper(int arr[],int low, int high, int key)
{
    int mid;
    while (low < high)
    {
        mid = (low + high + 1) / 2;
        if (arr[mid] <= key)
            low = mid;
        else
            high = mid - 1;
    }
    return low;
}

int lower(int arr[],int low, int high, int key)
{
    int mid;

    while (low < high)
    {
        mid = (low + high) / 2;
        if (arr[mid] >= key)
            high = mid;
        else
            low = mid + 1;
    }
    return low;
}

哈希查找目前只会用链地址法，学姐说也是最常用，其他以后有时间再看。。。

struct node
{
    int data;
    node *next;
}*H[N];
//挂
void suspend(int x)
{
    int tp = x%N;
    if (tp < 0) tp += N;
    node *p = new node;
    p->data = x;
    p->next = H[tp];
    H[tp] = p;
}
//查
int fine(int x)
{
    int tp = x%N;
    if (tp < 0) tp += N;
    int cnt = 0;

    for (node *p = H[tp]; p; p = p->next)
    {
        if (p->data == x) cnt++;
    }
    return cnt;
}

//vector 模拟实现的

vector<int> hash[N];
//挂
void suspend(int x)
{
    int tp = x%N;
    if (tp < 0) tp += N;
    hash[tp].push_back(x);
}
查
int find(int x)
{
    int tp = x%N;
    if (tp < 0) tp += N;
    int cnt = 0;
    int sz = hash[tp].size();
    for (int i = 0; i < sz; ++i)
    {
        if (hash[tp][i] == x) cnt++;
    }
    return cnt;
}