题目来源自leetcode与代码随想录
(1)206.反转链表
题意:
反转一个单链表。
示例: 输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
# Definition for singly-linked list.# class ListNode:#def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution:def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:curse = headprev = Nonewhile curse != None:# 记录下次要反转的位置tempNext = curse.next# 反转curse.next = prev# 更新指针prev = cursecurse = tempNextreturn prev
如果觉得《代码随想录一一一链表一一一反转链表》对你有帮助,请点赞、收藏,并留下你的观点哦!