Leetcode, leetcodeoj
Algorithm: Iterate and copy the original list first. for the random pointer, just copy the value from the original list first. and use a map to store each node's old address and its corresponding new address. after the iteration, we can replace the value of the random pointer based on the map we get.
Mistakes I make:
(1) Beware when head = null.
(2) Forget during the iteration: node = node. next;
public class Solution { public RandomListNode copyRandomList(RandomListNode head) { if(head == null) return null; RandomListNode newHead = new RandomListNode(head.label); newHead.random = head.random; RandomListNode node = newHead; Map<RandomListNode,RandomListNode> addrRef = new HashMap<RandomListNode,RandomListNode>(); addrRef.put(head, node); head = head.next; while(head != null) { RandomListNode tnode = new RandomListNode(head.label); tnode.random = head.random; node.next = tnode; addrRef.put(head, tnode); head = head.next; node = tnode; } node = newHead; while(node != null) { node.random = addrRef.get(node.random); node = node.next; } return newHead; }}
What is leetcode?
There are many programming and interview questions, which can be compiled and run online. It is difficult. If you can do it all by yourself, it is very helpful for large companies. I just did the questions there.
How does leetcode oj submit code?
You cannot write the main function. What you need is to implement a member function based on the interface provided by class Solution.
Give a reference answer
# Include <sstream> using namespace std; class Solution {public: void reverseWords (string & s) {string ans = "", temp; stringstream sin (s ); while (sin> temp) {if (ans! = "") {Ans = temp + "" + ans;} else {ans = temp ;}} s = ans ;}};