# Rehashing

{% embed url="<https://www.lintcode.com/problem/129/>" %}

## Solution 1 (Java)

```java
/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param hashTable: A list of The first node of linked list
     * @return: A list of The first node of linked list which have twice size
     */    
    public ListNode[] rehashing(ListNode[] hashTable) {
        int cap = hashTable.length * 2;
        ListNode[] newHashTable = new ListNode[cap];
        for (ListNode node : hashTable) {
            while (node != null) {
                int index = (node.val % cap + cap) % cap;
                ListNode newNode = new ListNode(node.val);
                if (newHashTable[index] == null) {
                    newHashTable[index] = newNode;
                } else {
                    ListNode head = newHashTable[index];
                    while (head.next != null) {
                        head = head.next;
                    }
                    head.next = newNode;
                }
                node = node.next;
            }
        }
        return newHashTable;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.yushunchen.com/algo/hash-table/rehashing.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.