Leetcode +206 Reverse Linked List"/>
Leetcode +206 Reverse Linked List
Leetcode +206 Reverse Linked List
题目描述
Reverse a singly linked list.
Example:
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
Follow up:
A linked list can be reversed either iteratively or recursively. Could you implement both?
来源:力扣(LeetCode)
链接:
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路解析
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = Noneclass Solution:def reverseList(self, head: ListNode) -> ListNode:new_head = None while head : tmp = head.next head.next = new_headnew_head = headhead = tmp return new_head
更多推荐
Leetcode +206 Reverse Linked List
发布评论