计蒜客c语言 蒜头君招聘程序,计蒜客 数据结构 蒜头君筛选用户

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

测试了很多样例都是对的 但一直过不去 求大神( ⊙ o ⊙ )啊！

#include

#include

using namespace std;

class HashTable {

private:

string *elem;

int size;

public:

HashTable() {

size = 300000;

elem = new string[size];

for (int i = 0; i < size; i++) {

elem[i] = "#";

}

}

~HashTable() {

delete[] elem;

}

int hash(const string& index) {

int code = 0;

for (size_t i = 0; i < index.length(); i++) {

code = (code * 256 + index[i] + 128) % size;

}

return code;

}

bool search(string& index, int& pos, int& times) {

pos = hash(index);

times = 0;

while (elem[pos] != "#" && elem[pos] != index) {

times++;

if (times < size) {

pos = (pos + 1) % size;

} else {

return false;

}

}

if (elem[pos] == index) {

return true;

} else {

return false;

}

}

int insert(string& index) {

int pos, times;

if (search(index, pos, times)) {

return 2;

} else if (times < size ) {

elem[pos] = index;

return 1;

} else {

recreate();

return 0;

}

}

void recreate()

{

string *temp_elem;

temp_elem=new string[size];

for(int i=0;i

{

temp_elem[i]=elem[i];

}

int copy_size=size;

size=size*2;

delete []elem;

elem=new string[size];

for(int i=0;i

{

elem[i]="#";

}

for(int i=0;i

{

if(temp_elem[i]!="#")

{

insert(temp_elem[i]);

}

}

delete []temp_elem;

}

};

int main() {

HashTable hashtable;

string a;

int n;

cin >> n;

for (int i = 1; i <= n; i++) {

cin >> a;

for(int i=0;i

{

if(a[i]>='A'&&a[i]<='Z')

{

a[i]=a[i]-'A'+'a';

}

}

int ans = hashtable.insert(a);

if (ans == 0) {

cout << "insert failed!" << endl;

} else if (ans == 1) {

cout << "NO" << endl;

} else if (ans == 2) {

cout << "YES" << endl;

}

}

return 0;

}