lurenaa的博客

😂代码实现

1
2
3
4
5
6
7
8
9
10
class Solution {
public:
int dominantIndex(vector<int>& nums) {
auto it = max_element(nums.begin(), nums.end());
for(auto be = nums.begin(); be != nums.end(); ++be)
if(be != it && *it < 2 * (*be))
return -1;
return it - nums.begin();
}
};

Accepted

250/250 cases passed (8 ms)

Your runtime beats 29.62 % of cpp submissions

Your memory usage beats 45.04 % of cpp submissions (8.4 MB)