Update 35. 复杂链表的复制.md

题目链接改为力扣中的对应题目，题目描述和代码按该题的接口调整。

notes/35. 复杂链表的复制.md

@@ -1,19 +1,21 @@
 # 35. 复杂链表的复制
 
-[NowCoder](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
+[Leetcode](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/)
 
 ## 题目描述
 
 输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点），返回结果为复制后复杂链表的 head。
 
 ```java
-public class RandomListNode {
-    int label;
-    RandomListNode next = null;
-    RandomListNode random = null;
+class Node {
+    int val;
+    Node next;
+    Node random;
 
-    RandomListNode(int label) {
-        this.label = label;
+    public Node(int val) {
+        this.val = val;
+        this.next = null;
+        this.random = null;
     }
 }
 ```
@@ -35,33 +37,33 @@ public class RandomListNode {
 <div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/e151b5df-5390-4365-b66e-b130cd253c12.png" width="600"/> </div><br>
 
 ```java
-public RandomListNode Clone(RandomListNode pHead) {
-    if (pHead == null)
+public Node copyRandomList(Node head) {
+    if (head == null)
         return null;
     // 插入新节点
-    RandomListNode cur = pHead;
+    Node cur = head;
     while (cur != null) {
-        RandomListNode clone = new RandomListNode(cur.label);
+        Node clone = new Node(cur.val);
         clone.next = cur.next;
         cur.next = clone;
         cur = clone.next;
     }
     // 建立 random 链接
-    cur = pHead;
+    cur = head;
     while (cur != null) {
-        RandomListNode clone = cur.next;
+        Node clone = cur.next;
         if (cur.random != null)
             clone.random = cur.random.next;
         cur = clone.next;
     }
     // 拆分
-    cur = pHead;
-    RandomListNode pCloneHead = pHead.next;
+    cur = head;
+    Node cloneHead = head.next;
     while (cur.next != null) {
-        RandomListNode next = cur.next;
+        Node next = cur.next;
         cur.next = next.next;
         cur = next;
     }
-    return pCloneHead;
+    return cloneHead;
 }
 ```