class Solution {
public int distributeCandies(int[] candies) {
int count=candies.length/2;
Set<Integer> set=new HashSet<>();
for(int i=0;i<candies.length;i++){
set.add(candies[i]);
}
if(set.size()>=count)return count;
else return set.size();
}
}
day-06:分糖果
最新推荐文章于 2024-08-23 15:54:50 发布