[문제]
[답안작성]
class Solution {
public int solution(int[] A) {
int result = 0;
for( int i = 1; i <= 100000; i++ ) {
int j = i;
if( !Arrays.stream( A ).anyMatch( a -> a == j ) ) {
result = i;
break;
}
}
if( result == 0 ) {
result = 100001;
}
return result;
}
}
[위의 답안은 느려서 다른 답안으로 변경]
class Solution {
public int solution(int[] A) {
Arrays.sort(A);
int result = 0;
for( int i = 1; i <= 100000; i++ ) {
int j = i;
if( Arrays.binarySearch(A, j) < 0 ) {
result = i;
break;
}
}
if( result == 0 ) {
result = 100001;
}
return result;
}
}
[codility] FrogRiverOne (0) | 2020.06.28 |
---|---|
[Codility] TapeEquilibrium (0) | 2020.06.28 |
[Codility]FrogJmp (0) | 2020.06.27 |
[Codiliy]OddOccurrencesInArray (0) | 2020.06.27 |
[Codility]CyclicRotation (0) | 2020.06.27 |
댓글 영역