First Try by

First Try by https://padlet.com/1165056/001 blog??? en-us 2017-05-05 07:53:59 UTC 2023-11-14 09:13:26 UTC hello@padlet.com https://padlet-assets.s3.amazonaws.com/icons/Lightdecrease.png #includeusing namespace std;void swap(int *a, int *b){ int tmp; tmp = *a; *a = *b; *b = tmp;}int partition(int arr[], int left, int right, int pivotIndex){ int storeIndex = left; int pivotValue = arr[pivotIndex]; int i; swap(&arr[pivotIndex],&arr[right]); for (i = left; i < right; i ++) { if (arr[i] > pivotValue) { swap(&arr[i],&arr[storeIndex]); storeIndex++; } } swap(&arr[storeIndex],&arr[right]); return storeIndex;}int findKMax(int arr[], int left, int right, int k){ int nRet; int pivotIndex = left + 1; nRet = partition(arr,left,right,pivotIndex); if (nRet < k){ return findKMax(arr,nRet+1,right,k); } else if (nRet > k){ return findKMax(arr,left,nRet-1,k); } return nRet;}int main(){ int i,k,nRet; int arr[] = {8,3,4,1,9,7,6,10}; scanf("%d",&k); nRet = findKMax(arr,0,7,k-1); printf("The Kth Max Number locate in %d is :%d\n",nRet,arr[nRet]); for (i = 0; i < 8; i++){ printf("%3d",arr[i]); } return 0;} 1165056 https://padlet.com/1165056/001/wish/170116640 2017-05-05 07:56:19 UTC https://padlet.com/1165056/001/wish/170116640 乱七八糟 https://padlet.com/1165056/001/wish/170116884 2017-05-05 07:58:32 UTC https://padlet.com/1165056/001/wish/170116884 看不下去了 https://padlet.com/1165056/001/wish/170116916 2017-05-05 07:58:49 UTC https://padlet.com/1165056/001/wish/170116916 这是啥？ https://padlet.com/1165056/001/wish/170117060 呃。。。。。]]> 2017-05-05 08:00:08 UTC https://padlet.com/1165056/001/wish/170117060 1165056 https://padlet.com/1165056/001/wish/170117118 2017-05-05 08:00:46 UTC https://padlet.com/1165056/001/wish/170117118 我也不知道是啥，先试试看吧 1165056 https://padlet.com/1165056/001/wish/170117342 等会找个视频发过来

]]> 2017-05-05 08:02:32 UTC https://padlet.com/1165056/001/wish/170117342 https://padlet.com/1165056/001/wish/170117797 2017-05-05 08:06:28 UTC https://padlet.com/1165056/001/wish/170117797