算法学习笔记 —— 链表

# -*- 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
        last_node = None
        current_node = pHead
        
        while current_node is not None:
            next_node = current_node.next
            current_node.next = last_node
            last_node = current_node
            current_node = next_node

        return last_node