LeetCode 206 Reverse Linked List 解题报告

2024-05-11 22:47:53

题目要求

Reverse a singly linked list.

Example:

　　Input: 1->2->3->4->5->NULL

　　Output: 5->4->3->2->1->NULL

题目分析及思路

给定一个单链表，要求得到它的逆序。可以使用列表对链表结点进行保存，之后新建一个列表对链表的逆序进行保存。最后返回新建列表的第一个元素即可。

python代码

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

def reverseList(self, head: ListNode) -> ListNode:

l = [head]

if head == None or head.next == None:

return head

while l[-1].next:

l.append(l[-1].next)

ans = [l.pop()]

while l:

ans[-1].next = l.pop()

ans.append(ans[-1].next)

ans[-1].next = None

return ans[0]

转载于:https://www.cnblogs.com/yao1996/p/10625318.html

LeetCode 206 Reverse Linked List 解题报告相关推荐

leetCode 206. Reverse Linked List 反转链表
206. Reverse Linked List Reverse a singly linked list. 反转一个链表. 思路: 采用头插法,将原来链表重新插一次返回即可. 代码如下: /*** ...
LeetCode 206 Reverse Linked List--反转链表--迭代与递归解法--递归使用一个临时变量，迭代使用3个
此题链接:Reverse Linked List - LeetCode Reverse a singly linked list. Example: Input: 1->2->3-> ...
Java for LeetCode 206 Reverse Linked List
Reverse a singly linked list. 解题思路: 用Stack实现,JAVA实现如下: public ListNode reverseList(ListNode head) {i ...
Leetcode 206. Reverse Linked List
Similar Questions Reverse Linked List II Binary Tree Upside Down Palindrome Linked List 思路:链表反转. 解法一 ...
[swift] LeetCode 206. Reverse Linked List
Reverse a singly linked list. func reverseList(_ head: ListNode?) -> ListNode? {var stack = [Int] ...
leetcode 206 Reverse Linked List
方法一:头插法方法二:递归法 #include<iostream> using namespace std; #include<vector> #include<alg ...
LeetCode Notes_#206 Reverse Linked List（C++,Python）
LeetCode Notes_#206 Reverse Linked List(C++,Python) LeetCode Linked List Contents 题目思路思考解答 C++ P ...
【??链表】LeetCode 92. Reverse Linked List II
LeetCode 92. Reverse Linked List II Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4306611.html ...
LeetCode 167.Two Sum II 解题报告
LeetCode 167.Two Sum II 解题报告题目描述 Given an array of integers that is already sorted in ascending ord ...

最新文章

热门文章