jlnwan的专栏

Map map = new TreeMap(                new Comparator() {                    public int compare(String obj1, String obj2) {                        // 降序排序                        return obj2.compareTo(o

//将map.entrySet转换为listList> list=new LinkedList>(map.entrySet());Collections.sort(list, new Comparator>() {public int compare(Map.Entry o1,Map.Entry o2) {return o1.getValue().compareTo

/** * java基本算法 二分法查找 * 前提int数组是升序排列  * 推荐冒泡 * 二分查找又称折半查找，它是一种效率较高的查找方法。 *二分查找要求：线性表是有序表，即表中结点按关键字有序，并且要用向量作为表的存储结构。不妨设有序表是递增有序的 * @author heqingfei * */public class TestBinSearch {  

import java.io.*;public class CopyFolder {public static void copyFolder(String oldPath, String newPath) throws IOException {File file = new File(oldPath);FileInputStream fis = null;FileOutpu

public class MergeSort { public static void mergeSort(int[] list) { if(list.length>1) { int[] firstHalf = new int[list.length/2]; System.arraycopy(list, 0, firstHalf, 0, list.length/2); m

基本思想：堆排序是一种树形选择排序，是对直接选择排序的有效改进。堆的定义如下：具有n个元素的序列（h1,h2,...,hn),当且仅当满足（hi>=h2i,hi>=2i+1）或（hi//不稳定import java.util.Arrays;public class HeapSort { public static void main(String[] args) {

public class BubbleSort { public static void bubbleSort(int[] list) { boolean flag = true; for( int n=1; n<list.length && flag; n++) { flag = false; for( int i=0; i<list.length-n; i++) {

public class QuickSort { private static void quickSort(int[] list, int first, int last) { if(last >first) { int pivotIndex=partition(list,first,last); quickSort(list,first,pivotIndex-1);

package my.IKAnalyzer;import java.io.BufferedReader;import java.io.File;import java.io.FileReader;import java.io.IOException;import java.io.StringReader;import java.util.Vector;import org.wltea.analyz