codility FrogRiverOne
来源:互联网 发布:淘宝发布宝贝最佳时间 编辑:程序博客网 时间:2024/06/08 18:41
Question:codility Lesson4 FrogRiverOne
My answer:
def solution(X,A): B = [0] * (X + 1) sumA = 0 for i in range(len(A)): if B[A[i]] == 0: B[A[i]] == 1 sumA += 1 if sumA == X: return i return -1
阅读全文
0 0
- [codility]FrogRiverOne
- codility FrogRiverOne
- FrogRiverOne
- Codility5 FrogRiverOne
- codility
- codility
- Lesson 4 Counting Elements FrogRiverOne
- Codility -- Fish
- Codility -- Brackets
- Codility -- grocery_store
- Codility -- Triangle
- [codility]Triangle
- [codility]Brackets
- [codility]Fish
- [codility]Dominator
- [codility]Equi
- [codility]equi
- [codility]MinAbsSumOfTwo
- 使用神经网络和遗传算法玩转 Flappy Bird
- Java抑制中序遍历和先序遍历 求二叉树
- CSS3自定义滚动条样式 -webkit-scrollbar
- java Pattern和Matcher详解
- SQL表连接查询(inner join、full join、left join、right join)
- codility FrogRiverOne
- JAVA解析xml文件(DOM)
- [ArchLinux] 蓝牙鼠标
- elasticsearch实现热门词汇展示
- 一个动画弹出框的 DEMO
- redis概念原理
- WordPress添加Meta Box的方法步骤
- ng2目录说明
- 【Android】由简至繁打造一种可记录字数的万金油EditText