File: root - text - article - 2020 - 02 - detect-linked-list-cycle.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 270 Views, 22918 Search Bots | 120 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 270 Views, 22918 Search Bots | 120 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
Given a linked list, determine if the linked list has a cycle in it. For notation purposes, we use an integer pos which represents the zero-indexed position where the tail connects to.
Example:
Input: head = [4,3,2,1,0], pos = 1.
Output: true
The example indicates a list where the tail connects to the second node.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 270 Views, 22918 Search Bots | 120 Words Given a linked list, determine if the linked list has a cycle in it. For notation purposes, we use an integer pos which represents the zero-indexed position where the tail connects to.
Example:
Input: head = [4,3,2,1,0], pos = 1.
Output: true
The example indicates a list where the tail connects to the second node.
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def hasCycle(self, head):
# Fill this in.
testHead = ListNode(4)
node1 = ListNode(3)
testHead.next = node1
node2 = ListNode(2)
node1.next = node2
node3 = ListNode(1)
node2.next = node3
testTail = ListNode(0)
node3.next = testTail
testTail.next = node1
print(Solution().hasCycle(testHead))
# True
Related Articles
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Daily Interview Problem: Circle of Chained Words
- Daily Interview Problem: Product of Array Except Self
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Algorithm Interview: Convert Roman Numerals to Decimal
- Invert a Binary Tree
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Algorithm Interview: Subarray With Target Sum
- Daily Interview Problem: Running Median
- Progess made
©2006~2024 SteakOverCooked - 0.01753 Seconds(s) - 1165.681 KB/s - 50 Online Memory: 493.46 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !