class Solution {
public int dominantIndex(int[] nums) {
if(nums.length <= 1)
return nums.length == 0 ? -1 : 0;
int first = nums[0]>nums[1] ? nums[0] : nums[1];
int second = nums[0]>nums[1] ? nums[1] : nums[0];
int ind_first = nums[0]>nums[1] ? 0 : 1;
int ind_second = nums[0]>nums[1] ? 1 : 0;
if(nums.length == 2)
if(first >= second*2)
return nums[1]>nums[0] ? 1 : 0;
else
return -1;
for(int i=2;i<nums.length;i++)
{
if(first < nums[i])
{
second = first;
ind_second = ind_first;
first = nums[i];
ind_first = i;
}
else if(second < nums[i])
{
second = nums[i];
ind_second = i;
}
}
if(first >= second *2)
return ind_first;
else
return -1;
}
}
leetcode - 747 至少是其他数字两倍的最大数
最新推荐文章于 2021-02-19 18:16:44 发布