-
Notifications
You must be signed in to change notification settings - Fork 0
/
conjunto.cpp
79 lines (69 loc) · 1.47 KB
/
conjunto.cpp
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
#include<iostream>
#include<list>
using namespace std;
class Set
{
list<int> *data;
int size;
Set()
{
size = 100;//tamallo de arreglo 100
data = new int[size];//se crea el arreglo
}
Set(int s)
{
size = s;
data = new int[size];
}
int hash(int value)
{
return value%size;//calcula posicion
}
void insert(int value)
{
int pos = hash(value);//calcula posicion
for (int val:data[pos])//vamos a tomar cada valor dentro de data
{
if(val == value)
{
return;
}
}
data[pos].push_back(value);//insertar valor en arreglo
}
bool find(int value)
{
int pos = hash(value);//calcula posicion
for (int val:data[pos])//vamos a tomar cada valor dentro de data
{
if(val == value)
{
return true;
}
}
return false;
}
void print()
{
for(int i=0; i<size; i++)
{
cout << "[" << i << "]";
for(auto j=data[i].begin(); j!=data[i].end(); j++)
{
cout << *j << ",";
}
cout << endl;
}
}
};
int main()
{
Set s(9);
s.insert(5);
s.insert(15);
s.insert(3);
s.insert(3);
s.print();
cout << s.find(3) << endl;
return 0;
}