From b94e35880702c6db9f9820b026d99a2a142a5901 Mon Sep 17 00:00:00 2001
From: Fairyhead <contact@Fairyhead.info>
Date: Mon, 22 Oct 2018 00:12:42 +0800
Subject: [PATCH] Update solution 160 [README.md]

---
 .DS_Store                                     | Bin 0 -> 6148 bytes
 solution/.DS_Store                            | Bin 0 -> 14340 bytes
 .../README.md                                 |  84 ++++++++++++++++++
 .../Solution.java                             |  50 +++++++++++
 4 files changed, 134 insertions(+)
 create mode 100644 .DS_Store
 create mode 100644 solution/.DS_Store
 create mode 100644 solution/160.Intersection of Two Linked Lists/README.md
 create mode 100644 solution/160.Intersection of Two Linked Lists/Solution.java

diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..c9f5305ee481f4ad1f32d7a6754dc6ea5b57dd12
GIT binary patch
literal 6148
zcmeHKTTc@~6g~qLwnb#QBhh4IV?qKkfLu%rp%#eN8<i3)0+!wGQZ{aPn%ylGDyF}H
zclie<{s5nR^TA(W;){R42cLY^GnXPzjc<gQJ;}^>=3M4<zU|KJ002pr%`pHK02FKt
zBQfm$Ak5ENgEUD?3nJljJcbM`q#T+zoQCMo5Hb)laNZbT?`|tRgcQud0vvmPsevB0
zE!@U7^pgu}08v=N$U86(j}UJ_5lr#MA7#8fm7#zS6dWi+05)pw$#~NLuXv;4mkfu`
z|H&vhwjYd+ekM)Lkqa%YiV{;|?Xiu_Hmzg=Jt+H0-CJX$v>t35QeURjIns4w#kMLr
zwP%jHfo{8&$CGW-!jSc+wrkQ#l9pZ5=ksKQLs6niG^Y+!tK*ZCBii`Xt^E<LIz2r)
zqD|bK+TV{V{ny84Qk%uyz3Qv|*KZhCxG&<y$fZMK9S%`xAjZz`$c2&*^@V;_)%sGS
zv9^otmpatWuI|pB&fdP>{(;`hgM(LcYPX^1Ulcs{qvxnYy`)pNvUZ-j8GFyl2G+}f
zDLJ+4RNRtfKL2f6-YsEF&u;^t>#k>6?pndK&Bd)P-wLuhwZqSQ)N#_(w*#BHtH->n
z>ppUy3anzv-J)1=2f1D>u`qwd@_fXG{OqdkdAeJ$lDiv@ZdlHuo1{TNi!74Oh6_o1
z7MqDz%9QlH?H1y*-vyiTM7pjF2}OmtPyphIgDlq-l`Ol|wW85@;(_!kFpPiY`*>_^
zLj?}t5Z=Li_y}L%8~h*<(nqe5VKPBx$Sk=>o{%N7OjgM=vL^DI>QDD-y_!H`A~rnT
zos8!?)GeT|o_8|sj7RcEC~aq4H!K%25HfK78DRT^hK*rDVof05I<Vtc0K^EIxuDKI
z8d#1dF(I)g5IrbFq#}w`BCi-kq@!JvaS4evfg&A<ynGN@naCRo;ni_|jfVqC2n_p>
zfslcd3^a?O%Fh3Vzu*5)CWWJrfsld!iUAUt&&(%rN%CxMSR6ZRHEf&Mn6S8-K%Rn~
jJdU}-j^Y7qT+pX61u-G9CJ-$s;fDaHA?!j1&Xj>))K~Z;

literal 0
HcmV?d00001

diff --git a/solution/.DS_Store b/solution/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..04354c9275607a06145518c082278d72f8d3d973
GIT binary patch
literal 14340
zcmeHNS#J|p6h0F|YoHY=Wl50`!&ZTWtn7=bN+Am(Duf7AsMJ<q$04zB?9_Hh(lk|G
zs`e+e{RQnmq3@OW3w>^1`qqBmxij&-*JDU%pi&rH<2xSDS?<}-@rXz;zEbQJ=@F3(
z4z6AA;NyFdkgN6L?>t&w2XH08aUBQFyF`X1EBB=;H7T~--Fl$|mk8g9<EZpXp93Gt
zP00gKQRbyKU9Qd*%GCny1exGFk&dVT=nGe_>0P1Rl~vFVWkyzHNeYCMx(g}4;{MA7
z#G1ZR38WH8C6G!WmB5=Q0p?!3GDpmsex?#gC6G#BTLO#^Ar7u%(Yj?;4ITJk3D4hI
z!s`p?DA4s<7_DQ`x@A@c1&o4XHK0M%Vgv>p*F)Zpbu3!9%xb_TFyInIl!K^436whE
zLcLvrF|($hsRU99v`XM2E}ca0-H#DKR&wZ^Yj{_&R<!dj!VmADlU|S#u2%ehI{3@!
z#6{jyTtkYhg!>ny3}~k(_d4>AFgzI9?&U>}D+W#ya-f-r0r;k6+QWm+-obMMcm{A}
zF-IVt$KZpz;kUXpa5f?9GDrSgOu;D+Q@3L3+X<#5&N!`bINLS8!fJgvntuFNST2|9
zjh>!oLC1m4gKxc^$sEoce)sT~xy9;gu90u7)W`F+&-raO-&ia}=Xa~s^7eVYaIZAK
z`k?FhM77e$mn!o$1uhlmamyF?OO;}Eb-cP#Db^KF&is(c9LgMe(AB-M(Kk4FHS8N2
z*}NKV3=j8Q4F~#%Ha8DtPF?E#c>3Ye`qvxZY<~Nbv9%zGZ0@LMdq3m*t_ATVSF4n(
zl?A{OZ<i{jABv%gnz0jyKHEz66boZ@6meeR2LL~=CXxs2I-u`jomaD+)iWD2f6L1g
z{EFcc&dM$gp*jCznezpuG5A~>RW-=nP@%EgR4#(bpt|rBcmr2(;5>|+u1DF#{PO!O
zBvn=?Sj4v(d~4{v>fr8f)D>(xmz54BeqAL-hq|R_C5+rSb_?|zsm6GX+vQY0<cKiW
zAU(=)-J?fWvFTj`y&>HfUB03_qTJ`<xD8NZNDA@!2%quzFWKF_K_GY5`M0H~J*2c>
z-E|K|R9@)K%~h9{t)Q@n*q5r4lf{+BoXE33bHAS@l|98?e1+JT7hk1h5(4OmjA{UF
zx@&v)WB|3@lL2^CMgV^UPPn3uX<WZx=I^e1GdOm3TTXWtGyfjc9wvY<0S5z>3ExQ>
zdrGT`CEUYM;JGws`wsRlVDATqSq*usfMRN}f`!YSh6J0t7sBsXM}OhQJu^D3f@U6_
z)!f5!s|aCNkq_Fc(-S@-zoWc9#mT&R6L_e+xM(9*nhGQTHGIxRzcGKt>doWK&FMMZ
z#r!@e%z9CV_jrJLJ3NHS1543KK(mlF8I?Jce@n%=j?@yfj*DN-{|C$biGLJ%+s&rT
zkR|ZS{XL4L7=i=lb5hD-Wqp#DB@aIxz{cMV^Y2slybYYpyQ~iAJUil79m2+U4EP4{
zHtuTI6ow})*Ik}i{5m{ckm1PXKfykz3;xYlL!%ID*mZJS#%*`bHpHQFQmMq6t3#d(
zJKeQv$*v5}K!U@lLb6)vP>!ahF@c18*rAPUfZ8L>`!)3Z2Vr|b$to?<)3y>ghhL7s
zA$v4W#w9f80Df>m?l%9NNB^C_uTboYU+Vw&2n+MSsQ?(}+3m++fIJj5=-0HRSU{+_
zk25+PYYlerY;BftFf?lL!L<qe&VZ8F79rso0ERVZCufxhhP7M3)eOE?r2xEb8W_I{
zVZd{+pHu8{BC~hcnk-A;nUuVpdm$CU&Y@s5!C>dNdU4A{sd~>)FwDu1Rx&!Fe6kj7
z<%<E%daA<ZN1v&%F&zgcPL#+GleI}@4V*WdxCD+=FE*YJ6c6>{+s1_Ajf()&q(6cM
ztht=2E^Le$#YkQBtCT$(XBu&2a#8O$_3^wG9i~2=iBeay5V*dbsHb4XOtr>(qG^-M
z7iAx0JlWF|vT_g7VslOm)B_VeYh5N8w!H~8uY>6{u=J@f)0RzIZMMd)4M)8BIH?B*
zXSd>{K5d+j!QsyE!6O`erxYLcnnPiihX<Q61WT$q&gsc!_a*GW+c9<IU^}VU*n><%
zL(5Kw5JvIC6b_f=N`fBNEIrV2O~)_;Ue+|m%&HtY+-N%{p$7yuo->NaObp$qwoCo0
zE^N$Qz&xPENFrY?(xU8bc*cqWVXSBa56QR8R#oOU7RqT*J^U8*w+4;H!ygm7XtxRD
z9ku&EEO{RVo*}hXdt79S)4DV~ZBfcLG-WXaYtPE3u$Yp31syR`(QoK6zU9!aZFtIJ
zNO#c&K2a8wsE>suZ5Ek_p35iC;#@?#%i~+J728-SiD7L8VxM9r<DiahjkgoZvEwsK
zj#mIZqLN?+X!g;QkO)13dBuza>0iyJBBo`Aa&bIJumD=PL-9kU*xI?j6h&9hw0Vct
zd8K9YfZHl?w;TjA!^HnInCNi>dxix;dJAfaex!#M9U8}!28(<Xby-g|2aJ(qJU$VL
z92|_jquW}r+atm!%`;j&O*Q+}(k!coQEj>0cD6a9o(AS!j*hKoC(UGxIivj${3fK#
z-IQTFw;@e^A`|B?7=^1IxA)SreNUKBh|_zg{eRm3v+#+_f#*&>(*A$H{3V$7|7by8
z)9aw2)5GWgrtoiSo9F*u6E`WDR0634{tpQRos+rAaZnE0Q0KFDA&!SQ;ur4K+wq}~
v;$hWC@$iL@;*G@jam8<A(Yj?;1;up*#rm2a0!;h=wEx%UidHCZbpQV^%OkG2

literal 0
HcmV?d00001

diff --git a/solution/160.Intersection of Two Linked Lists/README.md b/solution/160.Intersection of Two Linked Lists/README.md
new file mode 100644
index 0000000000000..d84b490138757
--- /dev/null
+++ b/solution/160.Intersection of Two Linked Lists/README.md	
@@ -0,0 +1,84 @@
+## 相交链表
+### 题目描述
+
+编写一个程序，找到两个单链表相交的起始节点。
+
+
+示例 1：
+
+例如，下面的两个链表：
+
+A:          a1 → a2
+                   ↘
+                     c1 → c2 → c3
+                   ↗            
+B:     b1 → b2 → b3
+在节点 c1 开始相交。
+
+
+注意：
+
+如果两个链表没有交点，返回 null.
+在返回结果后，两个链表仍须保持原有的结构。
+可假定整个链表结构中没有循环。
+程序尽量满足 O(n) 时间复杂度，且仅用 O(1) 内存。
+
+### 解法
+第一遍循环，找出两个链表的长度差N
+第二遍循环，长链表先走N步，然后同时移动，判断是否有相同节点
+
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) {
+ *         val = x;
+ *         next = null;
+ *     }
+ * }
+ */
+public class Solution {
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+        if(headA == null || headB == null)
+            return null;
+        ListNode p = headA;
+        ListNode q = headB;
+        int pCount = 0;
+        int qCount = 0;
+        while(p.next != null || q.next != null){
+            if(p == q)
+                return p;
+            
+            if(p.next != null)
+                p = p.next;
+            else
+                qCount++;
+            
+            if(q.next != null)
+                q = q.next;
+            else
+                pCount++;
+        }
+        if(p != q)
+            return null;
+        p = headA;
+        q = headB;
+        while(pCount-- != 0){
+            p = p.next;
+        }
+        while(qCount-- != 0){
+            q = q.next;
+        }
+        while(p != q){
+            p = p.next;
+            q = q.next;
+        }
+            
+        return p;
+            
+            
+    }
+}
+```
\ No newline at end of file
diff --git a/solution/160.Intersection of Two Linked Lists/Solution.java b/solution/160.Intersection of Two Linked Lists/Solution.java
new file mode 100644
index 0000000000000..2b10a5f8c6f52
--- /dev/null
+++ b/solution/160.Intersection of Two Linked Lists/Solution.java	
@@ -0,0 +1,50 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) {
+ *         val = x;
+ *         next = null;
+ *     }
+ * }
+ */
+public class Solution {
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+        if(headA == null || headB == null)
+            return null;
+        ListNode p = headA;
+        ListNode q = headB;
+        int pCount = 0;
+        int qCount = 0;
+        while(p.next != null || q.next != null){
+            if(p == q)
+                return p;
+
+            if(p.next != null)
+                p = p.next;
+            else
+                qCount++;
+
+            if(q.next != null)
+                q = q.next;
+            else
+                pCount++;
+        }
+        if(p != q)
+            return null;
+        p = headA;
+        q = headB;
+        while(pCount-- != 0){
+            p = p.next;
+        }
+        while(qCount-- != 0){
+            q = q.next;
+        }
+        while(p != q){
+            p = p.next;
+            q = q.next;
+        }
+        return p;
+    }
+}
\ No newline at end of file