脚撕LeetCode(1287)Easy

    public static int findSpecialIntegerMy(int[] arr) {
        int thisNum = 0;
        int count = 0;
        // 右移两位 = 除以4 = 0.25
        // 这里考虑到有可能出现小数位所以向上取整
        int needCount = (int) Math.ceil(arr.length >> 2);
        for (int i : arr) {
            if (i == thisNum) {
                count++;
            } else {
                thisNum = i;
                count = 1;
            }
            if (count > needCount) {
                return thisNum;
            }
        }
        return -1;
    }

double count = arr.length * 0.25;
    int targetNum = Integer.MIN_VALUE;
    int targetCount = 0;
    for (int i = 0; i < arr.length; i++) {
        if(arr[i] != targetNum) {
            targetNum = arr[i];
            targetCount = 1;
        }else {
            targetCount++;
        }
        if(targetCount > count) {
            return targetNum;
        }
    }
    return targetNum;
}