1.算法通关面试 --- 数组和链表

数组：

链表：

1. 反转链表

https://leetcode.cn/problems/reverse-linked-list/

def reverseList(self, head):
    cur,pre = head, None

    while cur:
        cur.next, prev, cur = prev, cur, cur.next

    return prev

func reverseList(head *ListNode) *ListNode {
    var prev *ListNode
    cur := head

    for cur != nil {
        next := cur.Next
        cur.Next = prev
        prev = cur
        cur = next
    }

    return prev
}

2. 两两交换链表中的节点

https://leetcode.cn/problems/swap-nodes-in-pairs/

func swapPairs(head *ListNode) *ListNode {
    dummyHead = &ListNode{0, head}
    temp := dummyHead

    for temp.Next != nil && temp.Next.Next != nil {
        node1 := temp.Next
        node2 := temp.Next.Next

        temp.Next = node2
        node1.Next = node2.Next
        node2.Next = node1

        temp = node1
    }

    return dummyHead.Next
}

3. 判断链表是否有环

https://leetcode.cn/problems/linked-list-cycle/

func hasCycle(head *ListNode) bool {
    if head == nil || head.Next == nil {
        return false
    }

    slow, fast := head, head.Next

    for fast != slow {
        if fast == nil || fast.Next == nil {
            return false
        }

        slow = slow.Next
        fast = fast.Next.Next
    }

    return true
}