标签：while any color ext blog poi class node put
A linked list is given such that each node contains an additional random pointer
which could point to any node in the list or null. Return a deep copy of the list.
copy 的题多用hashmap, 难点在于如何让遍历, 如何构建新的节点间的关系.
/**
* Definition for singly-linked list with a random pointer.
* class RandomListNode {
* int label;
* RandomListNode next, random;
* RandomListNode(int x) { this.label = x; }
* };
*/
public class Solution {
public RandomListNode copyRandomList(RandomListNode head) {
// write your code here
HashMap<RandomListNode, RandomListNode> map = new HashMap<RandomListNode, RandomListNode>();
RandomListNode cur = head;
while (cur != null) {
RandomListNode copy = new RandomListNode(cur.label);
map.put(cur, copy);
cur = cur.next;
}
cur = head;
while (cur != null) {
map.get(cur).next = map.get(cur.next);
map.get(cur).random = map.get(cur.random);
cur = cur.next;
}
return map.get(head);
}
}
138 Copy List with Random Pointer
标签：while any color ext blog poi class node put
原文地址：http://www.cnblogs.com/apanda009/p/7226200.html
