本文共 346 字,大约阅读时间需要 1 分钟。
输入一个链表,反转链表后
# -*- 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 not pHead or not pHead.next: return pHead else: newHead=self.ReverseList(pHead.next) pHead.next.next=pHead pHead.next=None return newHead ,输出新链表的表头。转载地址:http://jftgn.baihongyu.com/