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 |
31 |
Tags
- ubuntu
- 자연어처리
- programmers
- 프로그래머스
- 맥북
- 금융문자분석경진대회
- Kaggle
- 더현대서울 맛집
- hackerrank
- Baekjoon
- PYTHON
- AI 경진대회
- Git
- gs25
- 편스토랑 우승상품
- leetcode
- 파이썬
- SW Expert Academy
- 프로그래머스 파이썬
- ChatGPT
- Real or Not? NLP with Disaster Tweets
- 데이콘
- dacon
- Docker
- 편스토랑
- 우분투
- 캐치카페
- 백준
- github
- 코로나19
Archives
- Today
- Total
목록
반응형
1436. Destination City (1)
반응형
솜씨좋은장씨
[leetCode] 1436. Destination City (Python)
You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path outgoing to another city. It is guaranteed that the graph of paths forms a line without any loop, therefore, there will be exactly one destination city. Example 1: Input: paths = [["London","New York"],["New..
Programming/코딩 1일 1문제
2020. 12. 6. 00:16
반응형