剑指offer 24:链表反转 -- java、python实现

题目

• 剑指offer 24.反转链表

---

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

题解

法1 – java、python实现

• 使用两个指针迭代遍历过程

1. java实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {

        ListNode p = head; // p为需要返回的头结点
        ListNode q = null; // 
        while(head != null){
            p = head;
            head = head.next; //head为遍历的节点
            p.next = q; 
            q = p;  //q暂存头结点         
        }
        return p;
    }
}

2. python实现

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        q = None
        while head is not None:  
            p = head
            head = head.next
            p.next = q
            q = p
        p = q
        return p