摘要：import java.beans.BeanInfo;import java.beans.Introspector;import java.beans.PropertyDescriptor; 阅读全文

摘要：import java.util.LinkedHashMap; import java.util.Map; public class LRUCache extends LinkedHashMap { private static final int MAX_CACHE_SIZE = 100; private int limit; public LRUCache() ... 阅读全文

摘要：package test;public class tree2 { private int data; private tree2 lChild; private tree2 rChild; public int getNodes(){ return (this.lChild == null ? 0 : this.lChild.... 阅读全文

摘要：模拟栈:class Stack { private List list = new ArrayList( ); public void push( Object obj ) { this.list.add( this.list.size( ), obj ); } public Object pop( 阅读全文

摘要：折半查找、二分法前提是列表是有序的。 public static int binarySearch(int[] arr, int des) { //定义初始最小、最大索引 int low = 0; int high = arr.length - 1; //确保不会出现重复查找，越界 while(lowdes) { high=m-1;... 阅读全文