Element Appearing More Than 25% In Sorted Array - LeetCode javascript solutions

Problem

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

Example 2:

Input: arr = [1,1]
Output: 1

Constraints:

1 <= arr.length <= 104
0 <= arr[i] <= 105

Solution

/**
 * @param {number[]} arr
 * @return {number}
 */
var findSpecialInteger = function(arr) {
    var len = 0;
    var num = -1;
    for (var i = 0; i < arr.length; i++) {
        if (arr[i] === num) {
            len += 1;
        } else {
            num = arr[i];
            len = 1;
        }
        if (len > (arr.length / 4)) return num;
    }
};

Explain:

nope.

Complexity:

Time complexity : O(n).
Space complexity : O(1).