(int key)
| 12 | } |
| 13 | |
| 14 | public int get(int key) { |
| 15 | int i = idx(key); |
| 16 | if (nodes[i] == null) |
| 17 | return -1; |
| 18 | ListNode node = find(nodes[i], key); |
| 19 | return node.next == null ? -1 : node.next.val; |
| 20 | } |
| 21 | |
| 22 | public void remove(int key) { |
| 23 | int i = idx(key); |
no test coverage detected