From 20962c488a21be961f03850c57eb4daefdf27012 Mon Sep 17 00:00:00 2001 From: sangbeenmoon Date: Thu, 30 Apr 2026 09:43:51 +0900 Subject: [PATCH 1/2] solved linked-list-cycle. --- linked-list-cycle/sangbeenmoon.py | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 linked-list-cycle/sangbeenmoon.py diff --git a/linked-list-cycle/sangbeenmoon.py b/linked-list-cycle/sangbeenmoon.py new file mode 100644 index 0000000000..ccc32055ef --- /dev/null +++ b/linked-list-cycle/sangbeenmoon.py @@ -0,0 +1,18 @@ +# Definition for singly-linked list. +class ListNode: + def __init__(self, x): + self.val = x + self.next = None + +class Solution: + def hasCycle(self, head: Optional[ListNode]) -> bool: + MM = 10001 + cnt = 0 + cur = head + while cur != None: + cnt += 1 + if cnt > MM: + return True + cur = cur.next + + return False From 778d9acc23b18e9fd64eda97624521cc07470e4f Mon Sep 17 00:00:00 2001 From: sangbeenmoon Date: Sat, 2 May 2026 08:51:48 +0900 Subject: [PATCH 2/2] refactor: while condition --- linked-list-cycle/sangbeenmoon.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/linked-list-cycle/sangbeenmoon.py b/linked-list-cycle/sangbeenmoon.py index ccc32055ef..3e3a24c7df 100644 --- a/linked-list-cycle/sangbeenmoon.py +++ b/linked-list-cycle/sangbeenmoon.py @@ -9,7 +9,7 @@ def hasCycle(self, head: Optional[ListNode]) -> bool: MM = 10001 cnt = 0 cur = head - while cur != None: + while cur: cnt += 1 if cnt > MM: return True