문제
Programs write log files with one event per line. Each line starts with a level word followed by a space and a message, for example ERROR disk full.
Given the lines of a log file, count the lines whose first word is exactly INFO, WARNING or ERROR. Lines that start with anything else (including lowercase levels) are ignored.
Implement count_log_levels(lines).
Input
lines: The lines of the file, without line breaks.
Output
Return [info_count, warning_count, error_count].
제약 조건
0 ≤ number of lines ≤ 10,000
Each line has at most 200 characters
예시
입력:
lines = ["INFO server started", "ERROR disk full", "INFO user login", "WARNING slow query"]
예상 출력:
expected = [2, 1, 1]
입력:
std::vector<std::string> lines = {"INFO server started", "ERROR disk full", "INFO user login", "WARNING slow query"};
예상 출력:
std::vector<long long> expected = {2, 1, 1};
입력:
string[] lines = new string[] {"INFO server started", "ERROR disk full", "INFO user login", "WARNING slow query"};
예상 출력:
long[] expected = new long[] {2, 1, 1};
설명
Two lines start with INFO, one with WARNING and one with ERROR: [2, 1, 1].
입력:
lines = ["info lowercase", "DEBUG details", "ERROR"]
예상 출력:
expected = [0, 0, 1]
입력:
std::vector<std::string> lines = {"info lowercase", "DEBUG details", "ERROR"};
예상 출력:
std::vector<long long> expected = {0, 0, 1};
입력:
string[] lines = new string[] {"info lowercase", "DEBUG details", "ERROR"};
예상 출력:
long[] expected = new long[] {0, 0, 1};
설명
"info" is not "INFO" and DEBUG is not counted. The last line is just the word ERROR, which counts: [0, 0, 1].
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Only the first word of each line matters.
힌트 2
Split once at the first space and compare that word exactly.
힌트 3
Case matters: "info" is not "INFO", and a line can be just the level word.
예상 복잡도
O(total length) time, O(1) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.