本文共 595 字,大约阅读时间需要 1 分钟。
1.问题描述:
翻转一个链表。
2.样例:
给出一个链表1->2->3->null,这个翻转后的链表为3->2->1->null
3.代码:
"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @param: head: n @return: The new head of reversed linked list. """ def reverse(self, head): # write your code here if head is None: return None p = head cur = None pre = None while p is not None: cur = p.next p.next = pre pre = p p = cur return pre
转载地址:http://oauii.baihongyu.com/