codility Dominator

来源:互联网 发布:拓扑排序算法c实现 编辑:程序博客网 时间:2024/06/04 23:19

Question:codility Lesson8 Dominator

My Answer:

def solution(A):    lenA = len(A)    candidate = -1    candidatecnt = 0    index = -1    for i in range(lenA):        if candidatecnt == 0:            candidate = A[i]            candidatecnt += 1            index = i        else:            if A[i] == candidate:                candidatecnt += 1            else:                candidatecnt -= 1    if len([ele for ele in A if ele == candidate]) <= lenA // 2:        return -1    else:        return index
原创粉丝点击