575. 分糖果 - 力扣(LeetCode)
方法一
可以做,但提示超时了
#define MIN(x, y) (x < y ? x : y)int distributeCandies(int* candyType, int candyTypeSize)
{int p = 0;char flag = 1;for (int i = 1; i < candyTypeSize; ++i){for (int j = 0; j <= p; ++j){if (candyType[i] == candyType[j]){flag = 0;break;}}if (flag){++p;candyType[p] = candyType[i];}flag = 1;}return MIN(p + 1, candyTypeSize / 2);
}