3737. Count Subarrays With Majority Element I

class Solution {
    public int countMajoritySubarrays(int[] nums, int target) {
        int n = nums.length;
        int ans = 0;

        for (int i = 0; i < n; i++) {
            int cnt = 0;

            for (int j = i; j < n; j++) {
                if (nums[j] == target) {
                    cnt++;
                }

                int len = j - i + 1;

                if (cnt * 2 > len) {
                    ans++;
                }
            }
        }

        return ans;
    }
}

class Solution:
    def countMajoritySubarrays(self, nums: List[int], target: int) -> int:
        n = len(nums)
        ans = 0

        for i in range(n):
            cnt = 0

            for j in range(i, n):
                if nums[j] == target:
                    cnt += 1

                length = j - i + 1

                if cnt * 2 > length:
                    ans += 1

        return ans

class Solution {
public:
    int countMajoritySubarrays(vector<int>& nums, int target) {
        int n = nums.size();
        int ans = 0;

        for (int i = 0; i < n; i++) {
            int cnt = 0;

            for (int j = i; j < n; j++) {
                if (nums[j] == target) {
                    cnt++;
                }

                int len = j - i + 1;

                if (cnt * 2 > len) {
                    ans++;
                }
            }
        }

        return ans;
    }
};

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var countMajoritySubarrays = function(nums, target) {
    const n = nums.length;
    let ans = 0;

    for (let i = 0; i < n; i++) {
        let cnt = 0;

        for (let j = i; j < n; j++) {
            if (nums[j] === target) {
                cnt++;
            }

            const len = j - i + 1;

            if (cnt * 2 > len) {
                ans++;
            }
        }
    }

    return ans;
};