leetcode

0 class Solution {

1 public:

2 int minimumIndex(const vector<int> &nums) {

3 int candid = nums[0], count = 0;

4 for (const int n : nums) {

5 if (!count) candid = n;

6 count += candid == n ? 1 : -1;

7 }

8

9 int ccount = 0;

10 for (const int n : nums)

11 if (n == candid) ccount++;

12

13 count = 0;

14 for (int i = 0; i < nums.size(); i++) {

15 if (nums[i] == candid) count++;

16 if ((count * 2 > i + 1) && (ccount - count) * 2 > nums.size() - i - 1) return i;

17 }

18

19 return -1;

20 }

21 };