反转链表

1、定义链表结构

    class LinkNode{
        int val;
        LinkNode next;
        public LinkNode(int val) {
            this.val = val;
        }
    }

2、链表反转

    public LinkNode reverseLinkNode(LinkNode pHead) {
        if (pHead == null || pHead.next == null) {
            return pHead;
        }
        LinkNode newNode = pHead;
        LinkNode curr = pHead.next;
        LinkNode temp = null;
        while (curr != null) {
            temp = curr.next;
            curr.next = newNode;
            newNode = curr;
            curr = temp;
        }
        return newNode;
    }