반응형
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
#include <stdio.h>
#include <string.h>
#include <malloc.h>
typedef struct _score
{
int id;
int jumsu;
char name[10];
struct _score * next;
}SCORE;
#define MAX_ST 20
#define HASH_KEY 5
SCORE Hash_table[HASH_KEY];
int Get_Hash_Key(int id)
{
return id % HASH_KEY;
}
int Insert_Data(SCORE * d)
{
SCORE * p;
SCORE * q;
p = &Hash_table[Get_Hash_Key(d->id)];
q = calloc(1, sizeof(SCORE));
if (q == (void *)0) return -1;
*q = *d;
q->next = 0;
for (;;)
{
if ((p->next == (SCORE *)0x0) || (d->id < p->next->id))
{
q->next = p->next;
p->next = q;
return 1;
}
p = p->next;
}
return -1;
}
SCORE * Search_Data(int id)
{
SCORE * p;
p = Hash_table[Get_Hash_Key(id)].next;
if(p==(SCORE *)0) return (SCORE *)0;
for(;;)
{
if(p->id == id) return p;
if(p->next == (SCORE *)0) return (SCORE *)0;
p = p->next;
}
}
int Delete_Data(int id)
{
SCORE * p;
SCORE * prev;
prev = &Hash_table[Get_Hash_Key(id)];
p = prev->next;
for(;;)
{
if(p == (SCORE *)0) return -1;
if(p->id == id)
{
prev->next = p->next;
free(p);
return 1;
}
prev = p;
p = p->next;
}
}
|
cs |
" target="_blank" rel="noopener" data-mce-href="http://
반응형
'알고리즘 문제풀이' 카테고리의 다른 글
[CS] Stack, Queue (Heap기반) (0) | 2020.10.07 |
---|---|
[CS] Stack, Queue(Linear, Circular) (0) | 2020.10.07 |
[Hash]Open Address 방식 (0) | 2020.10.07 |
[Heap]Heap Sort (0) | 2020.10.07 |
[Heap]MaxHeap구성 (0) | 2020.10.07 |