本文整理汇总了Python中solution.Solution.reverseKGroup方法的典型用法代码示例。如果您正苦于以下问题：Python Solution.reverseKGroup方法的具体用法？Python Solution.reverseKGroup怎么用？Python Solution.reverseKGroup使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类solution.Solution的用法示例。
在下文中一共展示了Solution.reverseKGroup方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_0
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import reverseKGroup [as 别名]
def test_0():
sol = Solution()
assert sol.reverseKGroup(None, 3) is None
head = ListNode(1)
ans = sol.reverseKGroup(head, 3)
p = ans
assert p.val == 1; p = p.next
assert p is None
head = ListNode(1); q = head
p = ListNode(2); q.next = p; q = p
ans = sol.reverseKGroup(head, 2)
p = ans
assert p.val == 2; p = p.next
assert p.val == 1; p = p.next
assert p is None示例2: test_2
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import reverseKGroup [as 别名]
def test_2():
sol = Solution()
head = ListNode(1); q = head
p = ListNode(2); q.next = p; q = p
p = ListNode(3); q.next = p; q = p
ans = sol.reverseKGroup(head, 2)
p = ans
assert p.val == 2; p = p.next
assert p.val == 1; p = p.next
assert p.val == 3; p = p.next
assert p is None示例3: test_4
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import reverseKGroup [as 别名]
def test_4():
sol = Solution()
head = ListNode(1); q = head
p = ListNode(2); q.next = p; q = p
p = ListNode(3); q.next = p; q = p
p = ListNode(4); q.next = p; q = p
p = ListNode(5); q.next = p; q = p
p = ListNode(6); q.next = p; q = p
p = ListNode(7); q.next = p; q = p
p = ListNode(8); q.next = p; q = p
ans = sol.reverseKGroup(head, 2)
p = ans
assert p.val == 2; p = p.next
assert p.val == 1; p = p.next
assert p.val == 4; p = p.next
assert p.val == 3; p = p.next
assert p.val == 6; p = p.next
assert p.val == 5; p = p.next
assert p.val == 8; p = p.next
assert p.val == 7; p = p.next
assert p is None示例4: mkListNode
# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import reverseKGroup [as 别名]
from solution import ListNode
def mkListNode(nums):
"""
:type: nums: List
:rtype: ListNode
"""
head = lnp = ListNode(0)
for i in range(len(nums)):
lnp.next = ListNode(nums[i])
lnp = lnp.next
return head.next
def lsListNode(head):
"""
:type: head: ListNode
:rtype: List
"""
lnp = head
rList = []
while lnp:
rList.append(lnp.val)
lnp = lnp.next
return rList
inpt = mkListNode([0, 1, 2, 3, 5])
k = 3
sol = Solution()
res = sol.reverseKGroup(inpt, k)
print(lsListNode(res))