1287. Element Appearing More Than 25% In Sorted Array (easy)

Q:

Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.

Return that integer.

Example 1:

Input: arr = [1,2,2,6,6,6,6,7,10]
Output: 6

Constraints:

• 1 <= arr.length <= 10^4
• 0 <= arr[i] <= 10^5

A:

class Solution {
public:
    int findSpecialInteger(vector<int>& arr) {
        int curVal = arr[0];
        int count =0;
        int one4 = arr.size()/4;
        for(auto v:arr)
        {
            if(v == curVal)
            {
                count++;
                if(count > one4)
                {
                    return curVal;
                }
            }else{
                count =1;
                curVal = v;
            }
        }
        return -1; // should never hit
    }
};