- 拥有最多糖果的孩子（简单暴力破解）
链接：https://leetcode-cn.com/problems/kids-with-the-greatest-number-of-candies/
方法1
class Solution {
public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
List<Boolean> List=new ArrayList();
int max=Integer.MIN_VALUE;
for(int i=0;i<candies.length;i++){
if(candies[i]>max){
max=candies[i];
}
}
for(int i=0;i<candies.length;i++){
if((candies[i]+extraCandies)>=max){
List.add(true);
}else{
List.add(false);
}
}
return List;
}
}
方法2（优化后）
class Solution {
public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
int n = candies.length;
int maxCandies = 0;
for (int i = 0; i < n; ++i) {
maxCandies = Math.max(maxCandies, candies[i]);
}
List<Boolean> ret = new ArrayList<Boolean>();
for (int i = 0; i < n; ++i) {
ret.add(candies[i] + extraCandies >= maxCandies);
}
return ret;
}
}
持续更新中…