反转链表(简单)

反转链表

1、双指针
struct ListNode
{
    int val;
    ListNode* next;
    ListNode(int x):val(x), next(nullptr){}
};
class Solution{
    ListNode* reverseList(ListNode* head){
        ListNode* temp;
        ListNode* cur = head;
        ListNode* pre = NULL;
        while(cur)
        {
            temp = cur.next;
            cur.next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;
    }
}
class ListNode:
    def __init__(self, val = 0; next = None):
        self.val = val
        self.next = None
class Solution:
    def reverseList(self, head):
        pre = None
        cur = head
        while(cur):
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        return pre
2、递归法
struct ListNode{
    int val;
    ListNode* next;
    ListNode(x): val(x), next(nullptr){}
};
class Solution
{
    ListNode* reverse(ListNode*pre, ListNode*cur)
    {
        if(cur == NULL)
        {
            return pre;
        }
        ListNode*temp = cur.next;
        cur.next = pre;
        return reverse(cur, temp);
        
    }
    
    ListNode* reverseList(ListNode* head){
        reverse(NULL, head);
    }
}
class Solution:
    def reverse(self, pre, cur):
        if(cur == None):
            return pre;
        temp = cur.next
        cur.next = pre
        return self.reverse(cur, temp)
    def reverseList(self, head):
        return self.reverse(None, head)
        
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值