# golang_copy_list_with_random_pointer

A linked list of length `n` is given such that each node contains an additional random pointer, which could point to any node in the list, or `null`.

Construct a deep copy of the list. The deep copy should consist of exactly `n` brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the `next` and `random` pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.

For example, if there are two nodes `X` and `Y` in the original list, where `X.random --> Y`, then for the corresponding two nodes `x` and `y` in the copied list, `x.random --> y`.

The linked list is represented in the input/output as a list of `n` nodes. Each node is represented as a pair of `[val, random_index]` where:

• `val`: an integer representing `Node.val`
• `random_index`: the index of the node (range from `0` to `n-1`) that the `random` pointer points to, or `null` if it does not point to any node.

Your code will only be given the `head` of the original linked list.

## Examples

Example 1:

``````Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]

``````

Example 2:

``````Input: head = [[1,1],[2,1]]
Output: [[1,1],[2,1]]

``````

Example 3:

``````Input: head = [[3,null],[3,0],[3,null]]
Output: [[3,null],[3,0],[3,null]]

``````

Constraints:

• `0 <= n <= 1000`
• \$`-10^4\$ <= Node.val <=\$10^4\$`
• `Node.random` is `null` or is pointing to some node in the linked list.

## 解析

Space Complexity 也是 O(n)

## 程式碼

```/**
* Definition for a Node.
* type Node struct {
*     Val int
*     Next *Node
*     Random *Node
* }
*/

arr := []*Node{}
for cur != nil {
arr = append(arr, cur)
cur = cur.Next
}
var curN *Node
randomMap := make(map[*Node]*Node)
for idx, node := range arr {
if idx == 0 {
if node.Random != nil {
if random, exists := randomMap[node.Random]; exists {
} else {
randomMap[node.Random] = &Node{Val: node.Random.Val}
}
}
} else {
if n, exists := randomMap[node]; exists {
curN.Next = n
} else {
randomMap[node] = &Node{Val: node.Val}
curN.Next = randomMap[node]
}
if node.Random != nil {
if random, ok := randomMap[node.Random]; ok {
curN.Next.Random = random
} else {
randomMap[node.Random] = &Node{Val: node.Random.Val}
curN.Next.Random = randomMap[node.Random]
}
}
curN = curN.Next
}
}

}```

## 困難點

1. 需要避免重複制已經存在的結點
2. 需要設計一個機制去找詢已經存在的結點

## Solve Point

• Understand what the problem would like to solve
• Analysis Complexity

View Github