야간 전술보행 (연습문제)

원본 : https://school.programmers.co.kr/learn/courses/30/lessons/133501

프로그래머스

 

풀이

import java.util.Arrays;

class Solution {
    public int solution(int distance, int[][] scope, int[][] times) {
        for (int i = 0; i < scope.length; i++) {
            Arrays.sort(scope[i]);

            for (int j = scope[i][0]; j <= scope[i][1]; j++) {
                if (j % (times[i][0] + times[i][1]) > 0 && j % (times[i][0] + times[i][1]) <= times[i][0]) {
                    distance = Math.min(j, distance);
                    break;
                }
            }
        }

        return distance;
    }
}