javascript 实现有序列表合并

1. 使用数组

        var A = [2, 4, 8, 11, 11, 15]
        var B = [3, 5, 6, 7, 9, 9, 19, 20]
        function mergeOrderedArr(A, B) {
            let i =0, j=0
            while (i < A.length && j < B.length) {
                if (A[i] < B[j]) {
                    i++
                } else {
                    A.splice(i, 0, B[j])
                    i++
                    j++
                }
            }
            if (j < B.length) {
                while (j < B.length) {
                    A.push(B[j])
                    j++
                }
            }
            return A
        }
        console.log(mergeOrderedArr(A, B))    

2. 链表

    function Node(ele) {
            this.element = ele
            this.next = null
        }

        function Link() {
            this.head = new Node('')
            this.appendNode = appendNode
            this.display = display
        }

        function appendNode(ele) {
            var newNode = new Node(ele)
            var currentNode = this.head
            if (this.head.next === null) {
                currentNode.next = newNode
            } else {
                while (currentNode.next) {
                    currentNode = currentNode.next
                }
            }
            currentNode.next = newNode
        }       
        
        function display() {
            var currentNode = this.head
            let result = ''
            while (currentNode.next) {
                currentNode = currentNode.next
                result += currentNode.next ? currentNode.element + ',' : currentNode.element
            }
            return result
        }
        var A = new Link()
        A.appendNode(2)
        A.appendNode(7)
        A.appendNode(11)
        A.appendNode(11)
        A.appendNode(19)

        var B = new Link()
        B.appendNode(3)
        B.appendNode(5)
        B.appendNode(10)
        B.appendNode(13)
        B.appendNode(17)
        B.appendNode(21)
        
        var Ahead = A.head
        var Bhead = B.head
        var Apointer = Ahead.next
        var Bpointer = Bhead.next
        var Cpointer = Ahead
        function merge(A, B) {

            while (Apointer && Bpointer) {
                if (Apointer.element >　Bpointer.element) {
                    Cpointer.next = Bpointer
                    Cpointer = Bpointer
                    Bpointer = Bpointer.next
                } else {
                    Cpointer.next = Apointer
                    Cpointer = Apointer
                    Apointer = Apointer.next
                }
            }
            Cpointer.next = Apointer ? Apointer : Bpointer
        }
        merge(A, B)
        console.log(A.display())