728x90
https://hyunjiishailey.tistory.com/706
1. Java
class Solution {
public int solution(int[] schedules, int[][] timelogs, int startday) {
int answer = 0;
for ( int i = 0; i < schedules.length; ++i ) {
int time = schedules[i];
int time_h = (int) (time / 100);
int time_m = time % 100;
time_m += 10;
if ( time_m >= 60) {
time_m -= 60;
time_h++;
}
int time_admit = (time_h * 100) + time_m;
boolean able = true;
for ( int j = 0; j < timelogs[i].length; ++j ) {
int day = (j+startday) % 7;
if (day == 0 || day == 6) {
continue;
}
if ( time_admit < timelogs[i][j] ) {
able = false;
break;
}
}
if ( able ) {
answer++;
}
}
return answer;
}
}
2. Python
def solution(schedules, timelogs, startday):
answer = 0
for i in range(len(schedules)) :
time = schedules[i]
time_h = time // 100
time_m = time % 100
time_m += 10
if time_m >= 60 :
time_m -= 60
time_h += 1
time_admit = (time_h * 100) + time_m
for j in range(len(timelogs[i])) :
day = (j + startday) % 7
if day == 0 or day == 6 :
continue
if time_admit < timelogs[i][j] :
break
else :
answer += 1
return answer
반응형
'코딩 문제 풀기 ( Algorithm problem solving ) > 프로그래머스 ( Programmers )' 카테고리의 다른 글
[프로그래머스(Programmers)][Java,Python] (Lv1) 공원 (PCCE 기출문제 10번) (0) | 2025.03.25 |
---|---|
[프로그래머스(Programmers)][Java,Python] (Lv1) 붕대 감기 (PCCP 기출문제 1번) (0) | 2025.03.25 |
[프로그래머스(Programmers)][Java,Python] (Lv1) 공원 산책 (0) | 2025.03.24 |
[프로그래머스(Programmers)][Java,Python] (Lv1) 달리기 경주 (0) | 2025.03.24 |
[프로그래머스(Programmers)][Java,Python] (Lv1) 개인정보 수집 유효기간 (2023 KAKAO BLIND RECRUITMENT) (0) | 2025.03.24 |