int cmp(const void *a,const void *b){
return *(int*)a-*(int*)b;
}
int maxCoins(int* piles, int pilesSize){
qsort(piles,pilesSize,sizeof(int),cmp);
int n=pilesSize/3,count=0;
for(int i=pilesSize-2;i>=n;i-=2)count+=piles[i];
return count;
}
leetcode打卡74
最新推荐文章于 2022-11-12 12:02:37 发布