codility test
文章平均质量分 72
bluegrass986
这个作者很懒,什么都没留下…
展开
-
codility test
lesson 1: PermMissingElem package com.lesson1; import java.util.BitSet; /** * A zero-indexed array A consisting of N different integers is given. The array * contains integers in the range原创 2014-08-26 16:48:19 · 1440 阅读 · 0 评论 -
codility test 2
FrogRiverOne package com.lesson2; import java.util.BitSet; /** * * A small frog wants to get to the other side of a river. The frog is currently * located at position 0, and wants to ge原创 2014-08-26 16:50:35 · 916 阅读 · 0 评论 -
codility test3
package com.lesson2; /** * * You are given N counters, initially set to 0, and you have two possible * operations on them: increase(X) − counter X is increased by 1, max counter − * all counters原创 2014-08-29 10:44:15 · 772 阅读 · 0 评论 -
codility test 4
package com.lesson2; import java.util.BitSet; /** * * Write a function: class Solution { public int solution(int[] A); } that, * given a non-empty zero-indexed array A of N integers, returns the原创 2014-08-29 10:56:07 · 686 阅读 · 0 评论