堆排序 public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { ArrayList<Integer> res=new ArrayList<>(); for(int i=input.length/2-1;i>=0;i--){ maxheap(input,i,input.length); } for(int i=input...