本文整理汇总了Python中solution.Solution.hasCycle方法的典型用法代码示例。如果您正苦于以下问题：Python Solution.hasCycle方法的具体用法？Python Solution.hasCycle怎么用？Python Solution.hasCycle使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类solution.Solution的用法示例。
在下文中一共展示了Solution.hasCycle方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_0
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import hasCycle [as 别名]
def test_0():
sol = Solution()
assert not sol.hasCycle(None)
n1 = ListNode(1)
n1.next = n1
assert sol.hasCycle(n1)
n1 = ListNode(1)
assert not sol.hasCycle(n1)
n1 = ListNode(1)
n2 = ListNode(2)
n1.next = n2
assert not sol.hasCycle(n1)示例2: test_1
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import hasCycle [as 别名]
def test_1():
sol = Solution()
n1 = ListNode(1)
n2 = ListNode(2)
n1.next = n2
n3 = ListNode(3)
n2.next = n3
n4 = ListNode(4)
n3.next = n4
n5 = ListNode(5)
n4.next = n5
n5.next = n2
assert sol.hasCycle(n1)示例3: main
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import hasCycle [as 别名]
def main():
n = 0
head = None
nodes = None
solution = Solution()
line = stdin.readline()
while line:
head = None
hasCycle = False
n = int(line)
if n > 0:
nodes = [ListNode(x) for x in xrange(1, n + 1)]
for i in xrange(1, n):
line = stdin.readline()
a, b = map(lambda x: int(x) - 1, line.split(' '))
nodes[a].next = nodes[b]
if head == None:
head = nodes[a]
hasCycle = solution.hasCycle(head)
print 'Yes' if hasCycle else 'No'
line = stdin.readline()示例4: mkListNode
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import hasCycle [as 别名]
def mkListNode(nums, i, dic):
"""
:type: nums: List
:rtype: ListNode
"""
if nums[i] in dic:
return dic[nums[i]]
head = ListNode(nums[i])
dic[nums[i]] = head
if i + 1 < len(nums):
head.next = mkListNode(nums, i + 1, dic)
return head
def lsListNode(head):
"""
:type: head: ListNode
:rtype: List
"""
lnp = head
rList = []
while lnp != None:
rList.append(lnp.val)
lnp = lnp.next
return rList
dic = {}
inpt = mkListNode([3, 2, 0, -4, 2], 0, dic)
sol = Solution()
res = sol.hasCycle(inpt)
print(res)