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
- 코로나19
- hackerrank
- 더현대서울 맛집
- ubuntu
- 금융문자분석경진대회
- Baekjoon
- Real or Not? NLP with Disaster Tweets
- programmers
- 캐치카페
- 자연어처리
- 프로그래머스
- 백준
- github
- PYTHON
- 프로그래머스 파이썬
- AI 경진대회
- 편스토랑
- 맥북
- 우분투
- Docker
- dacon
- ChatGPT
- 편스토랑 우승상품
- SW Expert Academy
- Kaggle
- 데이콘
- 파이썬
- gs25
- leetcode
- Git
Archives
- Today
- Total
목록
반응형
2020/09/09 (1)
반응형
솜씨좋은장씨
[leetCode] 1337. The K Weakest Rows in a Matrix (Python)
Given a m * n matrix mat of ones (representing soldiers) and zeros (representing civilians), return the indexes of the k weakest rows in the matrix ordered from the weakest to the strongest. A row i is weaker than row j, if the number of soldiers in row i is less than the number of soldiers in row j, or they have the same number of soldiers but i is less than j. Soldiers are always stand in the ..
Programming/코딩 1일 1문제
2020. 9. 9. 20:43
반응형