From 2aed976e4653c5ba42bdedf420fc57cb6a0a5c1f Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyi.liu@17zuoye.com>
Date: Fri, 21 May 2021 14:25:55 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E9=9D=A2=E8=AF=95=E9=A2=98?=
 =?UTF-8?q?=2002.07.=20=E9=93=BE=E8=A1=A8=E7=9B=B8=E4=BA=A4=20javaScript?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/面试题02.07.链表相交.md | 36 +++++++++++++++++++++++++
 1 file changed, 36 insertions(+)

diff --git a/problems/面试题02.07.链表相交.md b/problems/面试题02.07.链表相交.md
index 493438d7..6bc331b5 100644
--- a/problems/面试题02.07.链表相交.md
+++ b/problems/面试题02.07.链表相交.md
@@ -155,6 +155,42 @@ Python：
 
 Go：
 
+javaScript: 
+
+```js
+/**
+ * @param {ListNode} headA
+ * @param {ListNode} headB
+ * @return {ListNode}
+ */
+var getListLen = function(head) {
+    let len = 0, cur = head;
+    while(cur) {
+       len++;
+       cur = cur.next;
+    }
+    return len;
+} 
+var getIntersectionNode = function(headA, headB) {
+    let curA = headA,curB = headB, 
+        lenA = getListLen(headA),
+        lenB = getListLen(headB);
+    if(lenA < lenB) {
+        [curA, curB] = [curB, curA];
+        [lenA, lenB] = [lenB, lenA];
+    }
+    let i = lenA - lenB;
+    while(i-- > 0) {
+        curA = curA.next
+    }
+    while(curA && curA !== curB) {
+        curA = curA.next;
+        curB = curB.next;
+    }
+    return curA;
+};
+```
+