最小的k个数

输入n个整数，找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字，则最小的4个数字是1,2,3,4,。

方法1：快排partition思想

import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer> list=new ArrayList<Integer>();
        if(input==null || input.length<=0 || input.length<k || k<=0)
            return list;
        int low=0,high=input.length-1;
        int index=partition(input,low,high);
        while(index!=(k-1)){
            if(index>(k-1)){
                high=index-1;
                index=partition(input,low,high);
            }else{
                low=index+1;
                index=partition(input,low,high);
            }
        }
        for(int i=0;i<=index;i++){
            list.add(input[i]);
        }
        return list;
    }
    
    public int partition(int[] array,int low,int high){   //快排，partition
        int temp=array[low];
        while(low<high){
            while(low<high && array[high]>=temp)
                high--;
            array[low]=array[high];
            while(low<high && array[low]<=temp)
                low++;
            array[high]=array[low];
        }
        array[low]=temp;
        return low;
    }
}

方法二：大根堆

import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Solution {
    public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
        ArrayList<Integer> list=new ArrayList<Integer>();
        if(input==null || input.length<=0 || input.length<k || k<=0)
            return list;
        
        PriorityQueue<Integer> heap=new PriorityQueue<Integer>(k,new Comparator<Integer>() {
			@Override
			public int compare(Integer o1, Integer o2) {
				return o2.compareTo(o1);
			}
		});
        for(int i=0;i<input.length;i++){
            if(heap.size()!=k){
                heap.add(input[i]);
            }else{
                int temp=heap.peek();
                if(temp>input[i]){
                    heap.poll();
                    heap.add(input[i]);
                }
            }
        }
        for(Integer i:heap){
            list.add(i);
        }
        return list;
    }
}

剑指offer编程题