解析这段代码：int main() { // 生成随机数集合 unordered_set<int> numbers = generateRandomNumbers(1000); // 构建线性探测法散列表和链地址法散列表 for (int num : numbers) { // 线性探测法插入 int pos = num % 10000; int i = 0; while (linearHashTable[pos] != 0) { pos = (pos + i) % 10000; i++; } linearHashTable[pos] = num; // 链地址法插入 ListNode* node = new ListNode(num); node->next = chainHashTable[pos]; chainHashTable[pos] = node; } // 统计线性探测法不同数字的查找长度和平均查找长度 vector<int> linearProbeCounts(1000, 0); int linearProbeTotal = 0; for (int num : numbers) { int count = linearProbeSearch(num); linearProbeCounts[num % 1000] += count; linearProbeTotal += count; } linearProbeAvg = (double)linearProbeTotal / numbers.size(); for (int i = 0; i < 1000; i++) { if (linearProbeCounts[i] > 0) { cout << "数字 " << i << " 的查找长度: " << (double)linearProbeCounts[i] / (numbers.size() / 1000) << endl; } } // 统计链地址法不同数字的查找长度和平均查找长度 vector<int> chainCounts(1000, 0); int chainTotal = 0; for (int num : numbers) { int count = chainSearch(num); chainCounts[num % 1000] += count; chainTotal += count; } chainAvg = (double)chainTotal / numbers.size(); for (int i = 0; i < 1000; i++) { if (chainCounts[i] > 0) { cout << "数字 " << i << " 的查找长度: " << (double)chainCounts[i] / (numbers.size() / 1000) << endl; } } cout << "线性探测法总平均查找长度: " << linearProbeAvg << endl; cout << "链地址法总平均查找长度: " << chainAvg << endl; return 0; }