0
点赞
收藏
分享

微信扫一扫

Kafka3.0.0版本——消费者(自动提交 offset)

题解:力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台 

代码如下:

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if(headA == null || headB == null){
            return null;
        }
        ListNode head1 = headA;
        ListNode head2 = headB;
        while(head1 != head2) {
            head1 = (head1 == null) ? headB : head1.next;
            head2 = (head2 == null) ? headA : head2.next;
        }
        return head1;
        
    }
}

 

举报

相关推荐

0 条评论