[1431] Kids With the Greatest Number of Candies

 直接取代原本array裡的值是個好主意！

雖然這樣改寫以後memory也沒有少用多少XD

給人信心的好(開心)題目 XD

bool* kidsWithCandies(int* candies, int candiesSize, int extraCandies, int* returnSize) {

int max=0;

bool *ret = calloc (candiesSize, sizeof(int));

for (int i=0;i <candiesSize; i++ )

{

if (candies[i]>max)

max = candies[i];

candies[i]+=extraCandies;

}

for (int i=0;i < candiesSize;i++)

{

if (candies[i] >= max)

ret[i]= true;

else

ret[i]= false;

}

*returnSize = candiesSize;

return ret;

}