Merge pull request #22 from daluozha/main

leetcode 160、328，剑指offer22 补充js代码

Author: chefyuan

animation-simulation/链表篇/leetcode328奇偶链表.md

@@ -89,3 +89,19 @@ public:
 };
 ```
 
+JS Code:
+```javascript
+var oddEvenList = function(head) {
+    if(!head || !head.next) return head;
+    let odd = head, even = head.next, evenHead = even;
+    while(odd.next && even.next){
+        odd.next = even.next;
+        odd = odd.next;
+        even.next = odd.next;
+        even = even.next;
+    }
+    odd.next = evenHead;
+    return head;
+};
+```
+

animation-simulation/链表篇/leetcode相交链表.md

@@ -79,6 +79,24 @@ public:
 };
 ```
 
+JS Code:
+```javascript
+var getIntersectionNode = function(headA, headB) {
+    let tempa = headA, tempb = headB
+    const map = new Map()
+    while(tempa){
+        map.set(tempa, 1)
+        tempa = tempa.next
+    }
+    while(tempb){
+        if(map.get(tempb))
+            return tempb
+        tempb = tempb.next
+    }
+    return tempb
+};
+```
+
 下面这个方法比较巧妙，不是特别容易想到，大家可以自己实现一下，这个方法也是利用我们的双指针思想。
 
 下面我们直接看动图吧，特别直观，一下就可以搞懂。
@@ -128,6 +146,18 @@ public:
 };
 ```
 
+JS Code:
+```javascript
+var getIntersectionNode = function(headA, headB) {
+    let tempa = headA, tempb = headB
+    while(tempa !== tempb){
+        tempa = tempa ? tempa.next : headB
+        tempb = tempb ? tempb.next : headA
+    }
+    return tempa
+};
+```
+
 好啦，链表的题目就结束啦，希望大家能有所收获，下周就要更新新的题型啦，继续坚持，肯定会有收获的。
 
 

animation-simulation/链表篇/剑指offer2倒数第k个节点.md renamed to animation-simulation/链表篇/剑指offer22倒数第k个节点.md

@@ -93,3 +93,18 @@ public:
 };
 ```
 
+JS Code:
+```javascript
+var getKthFromEnd = function(head, k) {
+    if(!head) return head;
+    let pro = head, after = head;
+    for(let i = 0; i < k - 1; i++){
+        pro = pro.next;
+    }
+    while(pro.next){
+        pro = pro.next;
+        after = after.next;
+    }
+    return after;
+};
+```