Leetcode：160. Intersection of Two Linked Lists(JAVA)

最新推荐文章于 2024-04-22 22:58:39 发布

那莫名

最新推荐文章于 2024-04-22 22:58:39 发布

阅读量325

点赞数

分类专栏： Leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u010183658/article/details/50866361

版权

Leetcode 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

【问题描述】

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3

begin to intersect at node c1.

【思路】

如果两个ListNode尾节点相同，则一定存在公共节点。

将长的List移步size1-size2步长后开始依次比较，直到找到相同节点后返回。

【code】

/**
 * 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 t1 = headA;
		ListNode t2 = headB;
		int size1 = 1, size2 = 1;

		while (t1.next != null) {
			size1++;
			t1 = t1.next;
		}

		while (t2.next != null) {
			size2++;
			t2 = t2.next;
		}

		if (t1.val != t2.val) {
			return null;
		} else {
			int t = Math.abs(size1 - size2);
			if (size1 > size2) {
				t1 = headA;
				t2 = headB;
			} else {
				t1 = headB;
				t2 = headA;
			}
			while ((t--) != 0) {
				t1 = t1.next;
			}
			while (t1 != null && t2 != null && t1 != t2) {
				t1 = t1.next;
				t2 = t2.next;
			}
			return t1;
		}
    }
}