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
- Baekjoon
- ChatGPT
- 코로나19
- SW Expert Academy
- programmers
- 금융문자분석경진대회
- 데이콘
- github
- 프로그래머스
- 더현대서울 맛집
- ubuntu
- Real or Not? NLP with Disaster Tweets
- Docker
- gs25
- dacon
- 우분투
- Kaggle
- 편스토랑 우승상품
- Git
- PYTHON
- AI 경진대회
- 백준
- 자연어처리
- 맥북
- 프로그래머스 파이썬
- leetcode
- 편스토랑
- hackerrank
- 파이썬
- 캐치카페
Archives
- Today
- Total
목록
반응형
2020/09/22 (1)
반응형
솜씨좋은장씨
[leetCode] 657. Robot Return to Origin (Python)
There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves. The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves..
Programming/코딩 1일 1문제
2020. 9. 22. 00:05
반응형