[Programmers] Lv.0 / 가까운 1 찾기 / Java

문제

 

풀이

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

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;
    }
}

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

import java.util.stream.IntStream;

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

 

출처

https://school.programmers.co.kr/learn/courses/30/lessons/181898