劍指Offer學習-面試題24:反轉鏈表

	/**
     * 反轉鏈表
     *
     * @param head
     * @return
     */
    public ListNode reverseListNode(ListNode head) {
        if (null == head) {
            return null;
        }
        ListNode res = null;
        ListNode cur = head;
        while (cur != null) {
            //保存當前節點的下一個節點
            ListNode next = cur.next;
            //將當前節點設置爲頭節點
            cur.next = res;
            res = cur;
            //將下一個節點賦值給當前節點
            cur = next;
        }
        return res;
    }