Level 0. 가까운 1 찾기

Level 0. 가까운 1 찾기

 

 

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> arr, int idx)
{
    auto result = find(next(arr.begin(), idx), arr.end(), 1);

    return (result == arr.end()) ? -1 : result - arr.begin();
}