[알고리즘문제풀기] 가까운 1 찾기

문제

내가 작성한 정답

for

class Solution {
    public int solution(int[] arr, int idx) {
        int answer = -1;
        for(int i = idx; i<arr.length; i++){
            if(arr[i]==1) {
                answer = i; 
                break;
            }
        }
        return answer;
    }
}

StreamAPI

import java.util.stream.*;

class Solution {
    public int solution(int[] arr, int idx) {
        return IntStream.range(idx,arr.length)
                    .filter(i-> arr[i]==1)
                    .findFirst()
                    .orElse(-1);
    }
}