算法-反轉單連結清單

1.非遞歸的解法

先上代碼：

public static LinkNode singleReverse(LinkNode node){
        if (node == null)
            return null;
        LinkNode head = null;
        LinkNode next = null;
        while (node != null){
            next = node.next;
            node.next = head;
            head = node;
            node = next;
        }
        return head;
    }
           

手寫解題過程思路：