题解 | #反转链表#
用两个栈实现队列
http://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
# -*- 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
head=None
while pHead :
#res.append(pHead.val)
pHead.next,head,pHead=head,pHead,pHead.next
return head
查看13道真题和解析