# [Leetcode]-Contains Duplicate HashTbale重解

603人阅读 评论(0)

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

Hide Tags： Array， Hash Table

//暴力求解
bool containsDuplicate(int* nums, int numsSize) {
int i = 0,j=0;
for(i=0;i<numsSize;i++)
{
for(j=i+1;j<numsSize;j++)
if(nums[i] == nums[j])
return true;
}
return false;
}

#include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
//hashtable
typedef int ElementType;

//hashtable
typedef unsigned int index1;
typedef struct listnode* position;
typedef struct listnode* list;
struct listnode{
ElementType data;
position next;
};

typedef struct hashtbl*  hashtable;
struct hashtbl {
int tablesize;
list *thelists;
};

index1 HashFunc(const ElementType key,int tablesize)
{
//unsigned int hashval = 0;
//while(*key != '\0')
//hashval = (hashval << 5) + *key++;
//return hashval % tablesize;

int index = key % tablesize;
return  index = index >= 0? index: index+tablesize;
}

hashtable InitializeHashTable(int tablesize)
{
hashtable H;
H = (hashtable)malloc(sizeof(hashtable));
if(NULL == H) return NULL;

H->tablesize = tablesize;

H->thelists = (list*)malloc(sizeof(list) * H->tablesize);
int i = 0;
for(i=0;i<H->tablesize;i++)//有表头
{
H->thelists[i] = (list)malloc(sizeof(struct listnode));
H->thelists[i]->next = NULL;
}
return H;
}
void DeleteHashTable(hashtable H)
{
position P,tem;
int i = 0;
for(i=0;i<H->tablesize;i++)
{
P = H->thelists[i]->next;
while(P != NULL)
{
tem = P;
free(tem);
P=P->next;
}
}
free(H->thelists);
free(H);
}
position Find(ElementType key,hashtable H)
{
position P;
list L;
L = H->thelists[ HashFunc( key, H->tablesize) ];
P = L->next;
while(P != NULL && P->data != key)
P = P->next;

return P;
}

bool Insert(ElementType key,hashtable H)
{
position pos,newnode;
list L;
pos = Find(key,H);
if(pos == NULL)
{
newnode = (position)malloc(sizeof(position));
L = H->thelists[ HashFunc( key, H->tablesize) ];
newnode->data = key;
newnode->next = L->next;
L->next = newnode;
}
else
return true;
}
void PrintHashTable(hashtable H)
{
position P;
int i = 0;
for(i=0;i<H->tablesize;i++)
{
P = H->thelists[i]->next;
printf("H->thelists[%d] = ",i);
while(P != NULL)
{
printf(" %d ->",P->data);
P=P->next;
}
printf("NULL\n");
}
}

bool containsDuplicate(int* nums, int numsSize) {
hashtable H;
int tablesize  = numsSize * 2;
H = InitializeHashTable(tablesize);
int i = 0;
for(i=0; i< numsSize; i++){
position pos,newnode;
list L;
pos = Find(nums[i],H);
if(pos == NULL)
{
newnode = (position)malloc(sizeof(position));
L = H->thelists[ HashFunc( nums[i], H->tablesize) ];
newnode->data = nums[i];
newnode->next = L->next;
L->next = newnode;
}
else
return true;
}
return false;
}

int main()
{
int nums[5] = {1,0,34,56,57};
bool r = containsDuplicate(nums,5);
printf("containsDuplicate is : %d \n",r);
}
1
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：246022次
• 积分：4075
• 等级：
• 排名：第7917名
• 原创：142篇
• 转载：41篇
• 译文：2篇
• 评论：79条
我的微博
博客专栏
 Android Framework 文章：7篇 阅读：5924
 机器学习实战 文章：0篇 阅读：0
 机器人视觉测量与控制 文章：7篇 阅读：16316
 数据结构与算法分析 文章：43篇 阅读：24631
评论排行