intersection_of_two_linked_lists

Author: hitzzc

README.md

@@ -139,6 +139,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [153. find minimum in rotated sorted array](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array)
 #### [154. find minimum in rotated sorted array II](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array_II)
 #### [155. Min Stack](https://github.com/hitzzc/go-leetcode/tree/master/min_stack)
+#### [160. Intersection of Two Linked Lists](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_linked_lists)
 
 
 

intersection_of_two_linked_lists/intersection_of_two_linked_lists.cpp

@@ -0,0 +1,39 @@
+struct ListNode {
+	int val;
+	ListNode *next;
+	ListNode(int x) : val(x), next(NULL) {}
+ };
+
+class Solution {
+public:
+	ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
+		int count1 = 0;
+		int count2 = 0;
+		ListNode* p1 = headA;
+		ListNode* p2 = headB;
+		while (p1 != NULL) {
+			++count1;
+			p1 = p1->next;
+		}
+		while (p2 != NULL) {
+			++count2;
+			p2 = p2->next;
+		}
+		int diff;
+		if (count1 > count2) {
+			diff = count1 - count2;
+			p1 = headA;
+			p2 = headB;
+		}else {
+			diff = count2 - count1;
+			p1 = headB;
+			p2 = headA;
+		}
+		for (; diff > 0; --diff) p1 = p1->next;
+		while (p1 != p2){
+			p1 = p1->next;
+			p2 = p2->next;
+		}
+		return p1;
+	}
+};