剑指Offer24:反转链表(Golang/Python/C#)

原题连接：剑指Offer24:反转链表

• 时间复杂度O(N):遍历链表使用线性大小时间。
• 空间复杂度O(1):变量pre和cur使用常数大小额外空间。

Golang

package main

type ListNode struct {
	Val  int
	Next *ListNode
}

package main

func reverseList(head *ListNode) *ListNode {
	if head == nil{
		return head
	}
	a := head
	b := head.Next
	for ;b != nil;{
		c := b.Next
		b.Next = a
		a = b
		b = c
	}
	head.Next = nil
	return a
}

Python

class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        if not head: return head
        a = head
        b = head.next
        while b:
            c = b.next
            b.next = a
            a = b
            b = c
        head.next = None
        return a

C#

public class ListNode
{
    public int val;
    public ListNode next;
    public ListNode(int x) { val = x; }
}
public class Solution
{
    public ListNode ReverseList(ListNode head)
    {
        if (head == null) return null;
        var a = head;
        var b = head.next;
        while(b != null) {
            var c = b.next;
            b.next = a;
            a = b;
            b = c;
        }
        head.next = null;
        return a;
    }
}