Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 |
Tags
- 금융문자분석경진대회
- github
- 우분투
- hackerrank
- 더현대서울 맛집
- 맥북
- leetcode
- Kaggle
- 캐치카페
- Baekjoon
- 백준
- 편스토랑
- dacon
- 자연어처리
- 파이썬
- 데이콘
- Docker
- ubuntu
- 프로그래머스 파이썬
- SW Expert Academy
- programmers
- 프로그래머스
- AI 경진대회
- Real or Not? NLP with Disaster Tweets
- gs25
- ChatGPT
- 편스토랑 우승상품
- Git
- 코로나19
- PYTHON
Archives
- Today
- Total
목록
반응형
551. Student Attendance Record I (1)
반응형
솜씨좋은장씨
[leetCode] 551. Student Attendance Record I (Python)
You are given a string representing an attendance record for a student. The record only contains the following three characters: 'A' : Absent. 'L' : Late. 'P' : Present. A student could be rewarded if his attendance record doesn't contain more than one 'A' (absent) or more than two continuous 'L' (late). You need to return whether the student could be rewarded according to his attendance record...
Programming/코딩 1일 1문제
2020. 8. 8. 19:54
반응형