标签:pre ListNode list List Linked 链表 next linked cycle
- 题目描述:
- Given a linked list, determine if it has a cycle in it.
To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.
Example 1:
Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.
Example 2:
Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.
Example 3:
Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.
解题思路:快慢指针判断是否有环。看了leetcode其他人的解法,改变了原来的链表结构,个人不建议。
- 示例代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode swapPairs(ListNode head) {
ListNode pre = head;
ListNode a = pre.next;
ListNode b = a.next;
if(pre == null || pre.next == null){
return pre;
}
while(a.next != null && b.next != null){
a.next = pre;
pre.next = b.next;
pre.next.next = b;
pre = a;
a = b;
b = a.next;
}
a.next = pre;
pre.next = b;
return pre;
}
}
标签:pre,ListNode,list,List,Linked,链表,next,linked,cycle 来源: https://blog.csdn.net/SmallNancy/article/details/88622996
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。