(int key)
| 31 | return -1; |
| 32 | } |
| 33 | public void remove(int key) { |
| 34 | int h = hash(key); |
| 35 | ListNode node = data[h]; |
| 36 | if (node == null) return; |
| 37 | if (node.key == key) data[h] = node.next; |
| 38 | else for (; node.next != null; node = node.next) |
| 39 | if (node.next.key == key) { |
| 40 | node.next = node.next.next; |
| 41 | return; |
| 42 | } |
| 43 | } |
| 44 | } |