1287. Element Appearing More Than 25% In Sorted Array

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.

class Solution {
public:
    int findSpecialInteger(vector<int>& A) {
        int n = A.size(), now = -1, cnt = 0;
        for(auto& x : A) {
            if(x == now) cnt += 1;
            else cnt = 1, now = x;
            if(cnt * 4 > n) return x;
        }
        return 0;
    }
};