摘要:
//线程休眠排序(沙雕排序,仅图一乐呵),时间复杂度全取决于数组中元素的大小!,而且会存在很多bug!! private static void threadSort(int[] nums){ for (int i = 0; i < nums.length; i++) { final int num 阅读全文
摘要:
AbstractQueue类 public abstract class AbstractQueue<E> { public abstract void push(E e); public abstract void pop(); public abstract E front(); } 用顺序表实 阅读全文
摘要:
AbstactStack类 public abstract class AbstractStack<E> { public abstract void pop(); public abstract void push(E e); public abstract E top(); } 用顺序表实现栈 阅读全文
摘要:
顺序表 public class ArrayList<E> extends AbstractList<E> { private Object[] arr =new Object[20]; private int size=0; @Override public int size() { return 阅读全文