首页 > 编程语言 > 详细

算法-02-反转链表

时间:2021-07-19 09:54:38      阅读:15      评论:0      收藏:0      [点我收藏+]

 描述

输入一个链表,反转链表后,输出新链表的表头。

Java 

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode ReverseList(ListNode head) {
       if(head == null)
           return null;
        else
           return reverserList(head);
    }
    
    public ListNode reverserList(ListNode head){
        if(head.next==null)
           return head;
        ListNode last = ReverseList(head.next);
        head.next.next = head;
        head.next = null;
        return last;
    }
}

Python

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    # 返回ListNode
    def ReverseList(self, pHead):
        # write code here
        if pHead is None:
            return None
        else:
            return self.reverseList(pHead)
        
    def reverseList(self, pHead):
        if pHead.next is None:
            return pHead
        else:
            last = self.reverseList(pHead.next)
            pHead.next.next = pHead
            pHead.next = None
            return last

 

算法-02-反转链表

原文:https://www.cnblogs.com/shix0909/p/15028463.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!