qq_36043775的博客

package com.neo.sort; import com.sun.scenario.effect.Merge; import java.util.Arrays; public class QuickSort { public static void main(String[] args) { int[] arr={1,3,5,3,4}; quickSort(arr,0,arr.length-1); print(arr); } .

话不多说，直接梭哈。 package com.neo.sort; import com.sun.scenario.effect.Merge; import java.util.Arrays; public class MergeSort { public static void main(String[] args) { int[] arr={1,3,5,3,4}; int[] sort = sort(arr); print(sort);

基于双向链表+hash表 节点对象 public class Node<K,V> { public K key; public V value; public Node<K,V> prev; public Node<K,V> next; public Node(K key, V value) { this.key = key; this.value = value; } pu