leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0747.cpp (457B)

0 class Solution { 1 public: 2 int dominantIndex(vector<int> &nums) { 3 int max1, max2, index; 4 max1 = max2 = index = 0; 5 6 for (int i = 0; i < nums.size(); i++) { 7 if (nums[i] > max1) { 8 index = i; 9 max2 = max1; 10 max1 = nums[i]; 11 } else if (nums[i] > max2) { 12 max2 = nums[i]; 13 } 14 } 15 return 2 * max2 <= max1 ? index : -1; 16 } 17 };