LeetCode笔记 747. 至少是其他数字两倍的最大数

问题描述：

代码：

class Solution {
public:
	int dominantIndex(vector<int>& nums) {
		if (nums.size() == 1)
		{
			return 0;
		}

		int value_1st = -1;
		int value_2nd = -1;

		int index_1st = -1;
		int index_2st = -1;

		for (int i = 0; i < nums.size(); i++)
		{
			if (nums[i] >= value_1st)
			{
				value_1st = nums[i];
				index_1st = i;
			}
		}

		for (int i = 0; i < nums.size(); i++)
		{
			if (nums[i] >= value_2nd && i != index_1st)
			{
				value_2nd = nums[i];
				index_2st = i;
			}
		}

		if (value_1st >= 2 * value_2nd) //题意 可不考虑负数
		{
			return index_1st;
		}
		else
		{
			return -1;
		}
	}

};