Leetcode 141 Linked List Cycle
来源：互联网 发布：网络中立规则 编辑：程序博客网 时间：2024/06/06 09:47
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
我一开始误会了cycle的意思= =晕
就是指这个list是一个圈 双指针搞定
/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public boolean hasCycle(ListNode head) { if(head == null) return false; ListNode point1 = head; ListNode point2 = head; while(point2.next != null && point2.next.next != null){ point1 = point1.next; point2 = point2.next.next; if(point1 == point2) return true; } return false; }} 0 0
- LeetCode(141)Linked List Cycle
- LeetCode 141 Linked List Cycle
- LeetCode 141 Linked List Cycle
- LeetCode: Linked List Cycle [141]
- [leetcode 141] Linked List Cycle
- [leetcode]141 Linked List Cycle
- LeetCode 141 Linked List Cycle
- leetcode || 141、Linked List Cycle
- Leetcode[141]-Linked List Cycle
- leetcode-141-Linked List Cycle
- [Leetcode 141] Linked List Cycle
- leetcode 141: Linked List Cycle
- [Leetcode]#141 Linked List Cycle
- leetCode #141 Linked List Cycle
- leetcode: (141) Linked List Cycle
- [leetcode] #141 Linked List Cycle
- 【leetcode】【141】Linked List Cycle
- 【LEETCODE】141-Linked List Cycle
- hdu 2027 切忌在输入测试案例个数后 要有一个getchar（） 吸收一个回车
- 坑【1】Switch
- 双向非循环链表(没有头结点)
- 解决android studio中出现的finished with non-zero exit value 1或者finished with non-zero exit value 2的问题
- c运行库、c标准库、windows API的区别和联系
- Leetcode 141 Linked List Cycle
- nginx location
- 【Java面试题-002】JRE与JDK的区别
- Qt 5.7 android 启动其他Android程序
- android pulltorefresh分析理解(上)
- Android性能优化之使用线程池处理异步任务
- Python奇技淫巧
- java设计模式之迭代子模式
- 坑【3】父类子类中关于super
