7-42 整型关键字的散列映射 (25分) --线性探测法

 1 #include <iostream>
 2 using namespace std;
 3 
 4 int main()
 5 {
 6     int N, P;
 7     cin >> N >> P;
 8     int flag[1100] = { 0 };
 9     int p[65536];
10   for(int i=0;i<65536;i++)
11   {
12     p[i] = -1;
13   }
14     for (int i = 0; i < N; i++)
15     {
16         int temp;
17           int pos;
18         cin >> temp;
19           if(p[temp] == -1)
20         {
21             pos = temp % P;
22             while (flag[pos%P] == 1)
23             {
24                 pos += 1;
25             }
26             flag[pos%P] = 1;
27             p[temp] = pos%P;
28         }
29         cout << p[temp];
30         if (i != N - 1)
31             cout << ' ';
32     }
33     return 0;
34 }