【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
来源:互联网 发布:ubuntu 14.04 16.04 编辑:程序博客网 时间:2024/09/21 06:35
【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
题目地址:https://leetcode.com/problems/intersection-of-two-linked-lists/description/
题目描述:
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.
Notes:If the two linked lists have no intersection at all, return null.The linked lists must retain their original structure after the function returns.You may assume there are no cycles anywhere in the entire linked structure.Your code should preferably run in O(n) time and use only O(1) memory.
整个过程找到两个链表相交的点,两链表长度可能不同,但是分别循环之后必定同时到达交点。
Solution:
/** * 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 a = headA; ListNode b = headB; while(a!=b){ a= a==null ? headB : a.next; b= b==null ? headA : b.next; } return a; }}
Date:2017年11月15日
阅读全文
0 0
- 【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
- [leetcode] 160. Intersection of Two Linked Lists 解题报告
- [Leetcode] 160. Intersection of Two Linked Lists 解题报告
- LeetCode Intersection of Two Linked Lists 解题报告
- 【LeetCode】Intersection of Two Linked Lists 解题报告
- Leetcode 160. Intersection of Two Linked Lists (Easy) (cpp)
- 160. Intersection of Two Linked Lists (Easy)
- [LeetCode]160.Intersection of Two Linked Lists
- LeetCode 160. Intersection of Two Linked Lists
- 【LeetCode】160.Intersection of Two Linked Lists
- [leetcode] 160.Intersection of Two Linked Lists
- [LeetCode]160. Intersection of Two Linked Lists
- LeetCode--160. Intersection of Two Linked Lists
- LeetCode 160. Intersection of Two Linked Lists
- 【LeetCode】160. Intersection of Two Linked Lists
- Leetcode 160. Intersection of Two Linked Lists
- LeetCode *** 160. Intersection of Two Linked Lists
- LeetCode 160. Intersection of Two Linked Lists
- qt移植输入法
- 利用msf生成后门拿shell
- 宋宝华:Docker 最初的2小时(Docker从入门到入门)
- 关于listView,我想说的
- 实验二 Linux用户管理
- 【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
- sqoop
- .net framework 3.5 Win10 安装方法
- and 和 or
- java修饰符(待补充)
- Laravel使用EasyWechat微信支付 超级简单
- VS跳过安全检查
- IDEA 代码不要折叠
- 新增全局属性