第9優(yōu)先隊列和堆排序110實現(xiàn)最小

階段三· 老師1對1的作業(yè)1-10實現(xiàn)最小堆動的邏輯，只有siftUp和siftDown兩個函數(shù)，當然，一些函數(shù)明要發(fā)生變化，比如findMax要改成findMin，extractMax要改成extractMin。importpublicclassMinHeap<EextendsComparable<E>>privateArray<E>publicMinHeap(intcapacity){data=new}publicdata=new}publicMinHeap(E[]arr){data=newif(arr.length!=1){for(inti=parent(arr.length-1);i>=0;i--)}}//publicintreturn}//返回一個布爾值,publicbooleanisEmpty(){return}//privateintparent(intindex){if(index==0)thrownewgrmtEet("ne-0doesn'thaveparent.");return(index-1)/2;}//privateintindex){returnindex*2+}//privateintindex){returnindex*2+}//publicvoide){data.addLast(e);siftUp(data.getSize()-1);}privatevoidsiftUp(int//while(k>0&&data.get(parent(k)).compareTo(data.get(k))>0){data.swap(k,parent(k));k=}}////publicfindMin(){if(data.getSize()==0)thrownewIllegalArgumentException("CannotfindMaxwhenheapisempty.");returndata.get(0);}//publicEEret=data.swap(0,data.getSize()-1);return}privatevoidsiftDown(intwhile(leftChild(k)<intj=leftChild(k);//在此輪循環(huán)中,data[k]和data[j]//if(j+1<data.getSize()data.get(j+1).compareTo(data.get(j))<0)j++;//data[j]leftChildrightChild//if(data.get(k).compareTo(data.get(j))<=0)data.swap(k,k=}}epublicErece(Ee){Eret=findMin();data.set(0,e);returnret;}publicstaticvoidmain(String[]args)intn MinHeap<Integer>minHeap=newMinHeap<>();Randomrandom=newRandom();for(inti=0;i<n;i++)minHeap.add(random.nextInt(Integer.MAXVALUE));int[]arr=newint[n];for(inti=0;i<n;i++)arr[i]=for(inti=1;i<n;i++)if(arr[i-1]>arr[i])thrownewSystem.out.println("TestMinHeap}}main函數(shù)，如果大家的最小堆實