wangyuesong2的专栏

package com; public class MergeSort { public static int inversionCounts = 0; private static Integer[] unsortedArray; public static Integer[] getUnsortedArray() { r

单链表的翻转非常基础，主要的问题在于生疏，以及while循环中判断条件的选择1.iterative method:public void reverseLinkedList(LinkedNode node) { LinkedNode previous = null; LinkedList next = null; LinkedList current = node; while(c