(int key, int val)
| 18 | return (int)((long)key * mult % size); |
| 19 | } |
| 20 | public void put(int key, int val) { |
| 21 | remove(key); |
| 22 | int h = hash(key); |
| 23 | ListNode node = new ListNode(key, val, data[h]); |
| 24 | data[h] = node; |
| 25 | } |
| 26 | public int get(int key) { |
| 27 | int h = hash(key); |
| 28 | ListNode node = data[h]; |