[프로그래머스] 가까운 1 찾기

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