牛客刷题Java实现---最小的K个数

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

public class Solution {
	public static void main(String[] args) {
		int [] input = {4,5,1,6,2,7,3,8};
		int k = 4;
		Solution s = new Solution();
		System.out.println(s.GetLeastNumbers_Solution(input, k));
	}
	public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
		
		 ArrayList<Integer> arr = new ArrayList<Integer>();
		 if(input.length<k) return arr;
		 int i=0;
		 Arrays.sort(input);
		
		 for(i =0; i<k;i++){
			 arr.add(input[i]);
				 
	     }
		return arr; 
    }
}