fix(linked list): Fix the method of retrieving element

Huubo · Huubo · commit cdd572f24cbb · 2019-01-06T12:44:38.000+08:00
diff --git a/src/algorithm/sorting/merge_sort/MergeSort.java b/src/algorithm/sorting/merge_sort/MergeSort.java
@@ -47,9 +47,11 @@ public static void merge(Comparable[] arr, int l, int mid, int r) {
         for (int k = l; k <= r; k++) {
 
             if (i > mid) {              // aux的左半部分[l-l, mid-l]元素已被全部遍历
-                arr[k] = arr[j - l];
+                arr[k] = aux[j - l];
+                j++;
             } else if (j > r) {         // aux的右半部分[mid+1-l, r-l]元素已被全部遍历
-                arr[k] = arr[i - l];
+                arr[k] = aux[i - l];
+                i++;
             } else if (aux[i - l].compareTo(aux[j - l]) < 0) {  // i所跟踪的元素小于j跟踪的元素
                 arr[k] = aux[i - l];
                 i++;
diff --git a/src/data_structure/linear_list/LinkedList.java b/src/data_structure/linear_list/LinkedList.java
@@ -384,7 +384,7 @@ private Node<E> node(int index) {
         } else {
             Node<E> x = last;
             for (int i = size - 1; i > index; i--) {
-                x = x.next;
+                x = x.prev;
             }
             return x;
         }
