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
阅读全文
0 0
- [codility]Dominator
- Codility-Dominator
- codility Dominator
- 【Codility】Dominator ★★
- codility
- codility
- 6.2 Dominator
- 构造Dominator Tree以及Dominator Frontier
- Codility -- Fish
- Codility -- Brackets
- Codility -- grocery_store
- Codility -- Triangle
- [codility]Triangle
- [codility]Brackets
- [codility]Fish
- [codility]Equi
- [codility]equi
- [codility]MinAbsSumOfTwo
- CF 842A
- Hinton Neural Networks课程笔记4a:使用神经网络做逻辑推理
- linux权限管理
- 51nod 1015 水仙花数
- UVA
- codility Dominator
- 你应该知道的JAVA面试题
- 图像物体分类
- Excel 代码编写 统一去掉单元格左上角的三角符号
- 引用与指针有何区别?何时只能使用指针不能使用引用?
- Windows Native WIFI 编程
- 自动行为操控Steering(十一)—分散(群体操控)
- linux 解决笔记本不能调节屏幕亮度问题
- Spring bean xml 配置继承