FilesExpand file tree

 master

/

chaining.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

67 lines (53 loc) · 1.73 KB

 master

/

chaining.java

Copy path

Top

File metadata and controls

• Code
• Blame

67 lines (53 loc) · 1.73 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package hashTable;

public class chaining {

static class Node {

int value;

Node next;

public Node(int value, Node next) {

this.value = value;

this.next = next;

}

static Node remove(Node node, int value) {

if (node == null) return null;

if (node.value == value) return node.next;

node.next = remove(node.next, value);

return node;

}

static boolean contains(Node node, int value) {

if (node == null) return false;

if (node.value == value) return true;

return contains(node.next, value);

}

}

static class HashTable {

static final int SIZE = 37;

Node[] a;

public HashTable() {

a = new Node[SIZE];

}

public void add(int value) throws Exception {

int index = value % SIZE;

a[index] = new Node(value, a[index]);

}

public void remove(int value) {

int index = value % SIZE;

a[index] = Node.remove(a[index], value);

}

public boolean contains(int value) {

int index = value % SIZE;

return Node.contains(a[index], value);

}

}

public static void main(String[] args) throws Exception {

int maxValue = 200, maxCount = 10;

HashTable hashTable = new HashTable();

int[] data = { 4, 13, 144, 7, 9, 11, 44, 115, 107, 196 };

for (int i = 0; i < data.length; ++i)

hashTable.add(data[i]);

hashTable.remove(11);

hashTable.remove(44);

for (int i = 1; i <= maxValue; ++i)

if (hashTable.contains(i))

System.out.println(i);

}

}