面试题16：反转链表

剑指Offer面试题16：反转链表（JS实现）

题目描述：定义一个函数，输入一个链表的头结点，反转该链表并输出反转后链表的头结点

    function LinkList() {
        var Node = function(element){
            this.element = element;
            this.next = null;
        }
        var head = null;

        //在尾部插入结点
        this.append = function(element) {
            var node = new Node(element),
                current;
            if(head === null) {
                head = node;
            }else{
                current = head;
                while(current.next) {
                    current = current.next;
                }
                current.next = node;
            }
        }


        //反转链表
        this.ReverseList = function(){
            if(head === null) {
                return null;
            }
            var reverseHead = null,
                current = head,
                prev = null,
                next = null;
            while(current){
                //保存结点防止断裂
                next = current.next;
                if(next === null) {
                    reverseHead = current;
                }
                current.next = prev;
                prev = current;
                current = next;
            }

            return reverseHead.element;

        }
    }

    var link = new LinkList();
    link.append(1);
    link.append(2);
    link.append(3);
    link.append(4);
    link.append(5);
    link.append(6);

    console.log(link.ReverseList());