题解 | #最小的K个数#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param input int整型一维数组
     * @param k int整型
     * @return int整型ArrayList
     */
    public ArrayList<Integer> GetLeastNumbers_Solution (int[] input, int k) {
        // write code here
        short[] flagArr = new short[1001];

        for (int i : input) {
            flagArr[i]++;
        }

        ArrayList<Integer>result = new ArrayList<>(k * 2);
        int count = k;
        for (int i = 0; i <= 1000 && count > 0; i++) {
            while(flagArr[i]>0&&count>0){
                result.add(i);
                flagArr[i]--;
                count--;
            }
        }

        return result;
    }
}