[题解][LeetCode][Linked List Cycle]
来源:互联网 发布:编辑录音的软件 编辑:程序博客网 时间:2024/05/16 11:14
题目:
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
题解:
我们需要一快一慢两指针。
快的一次走两步,慢的一次走一步。
如果有环,那么这两个指针在两次循环内肯定会相遇。
Code:
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # @param head, a ListNode # @return a boolean def hasCycle(self, head): p1 = head; p2 = head; while (p2 and p2.next): p1 = p1.next p2 = p2.next.next if (p1 == p2): return True return False
Ps:
Python里的boolean值,首字母要大写:
True & False
0 0
- LeetCode题解:Linked List Cycle
- [题解][LeetCode][Linked List Cycle]
- LeetCode题解:Linked List Cycle
- LeetCode题解:Linked List Cycle
- LeetCode Linked List Cycle & Linked List Cycle II题解
- [题解][LeetCode][Linked List Cycle II]
- LeetCode 题解(47): Linked List Cycle
- LeetCode题解——Linked List Cycle
- LeetCode题解:Linked List Cycle II
- Leetcode题解 141. Linked List Cycle
- Leetcode题解 141. Linked List Cycle
- Leetcode题解 142. Linked List Cycle II
- LeetCode 141 Linked List Cycle题解
- leetcode题解-141. Linked List Cycle
- leetcode题解-142. Linked List Cycle II
- leetcode题解-141. Linked List Cycle
- leetcode题解-142. Linked List Cycle II
- leetcode Linked List Cycle & Linked List Cycle ||
- Android中的手势识别
- 两个小时学会DirectDraw编程 (转)
- AIX 不能创建 高权限ID 的 问题
- Cloud Foundry中gorouter对StickySession的支持
- [cocos2dx笔记010]用于UI的事件管理器
- [题解][LeetCode][Linked List Cycle]
- bat编程基础(三)
- UVA299 Train Swapping
- CXF报错及解决方案
- 杂谈总结
- Android测试工具小结
- Ansible@一个高效的配置管理工具--Ansible configure management--翻译(十)
- Java ConcurrentHashMap类
- OMAPL138基于SYSLINK的双核通信LED实例