반응형
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
|
#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
#define STEP 1
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;
for(;;)
{
if(p->next == (SCORE *)0) break;
p = p->next;
}
p->next = q;
q->next = (SCORE *)0;
return 1;
}
SCORE * Search_Data(int id)
{
int pos;
int key;
pos = key = Get_Hash_Key(id);
for(;;)
{
if(Hash_table[pos].id == id) return &Hash_table[pos];
if(Hash_table[pos].id == -1) return (SCORE *)0;
pos += STEP;
if(pos == key) return (SCORE *)0;;
if(pos >= MAX_ST) pos = 0;
}
}
int Delete_Data(int id)
{
SCORE * p;
p = Search_Data(id);
if(p == (SCORE *)0) return -1;
p->id = -1;
return 1;
}
|
cs |
" target="_blank" rel="noopener" data-mce-href="http://
반응형
'알고리즘 문제풀이' 카테고리의 다른 글
[CS] Stack, Queue(Linear, Circular) (0) | 2020.10.07 |
---|---|
[Hash] Chainning 방식 (0) | 2020.10.07 |
[Heap]Heap Sort (0) | 2020.10.07 |
[Heap]MaxHeap구성 (0) | 2020.10.07 |
[HEAP] minheap 구성 (0) | 2020.10.07 |