Codility:BugfixingLeaderSorted

BugfixingLeaderSorted

function solution(A) {
    var n = A.length;
    var L = new Array(n + 1);
    L[0] = -1;
    var i;
    for (i = 0; i < n; i++) {
        L[i + 1] = A[i];
    }
    var count = 0;
    var pos = Math.floor((n/2)+1);
    candidate = L[pos];
    for (i = 1; i <= n; i++) {
        if (L[i] == candidate)
            count = count + 1;
    }
    if (count >= pos)
        return candidate;
    return (-1);
}