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
- Real or Not? NLP with Disaster Tweets
- github
- ChatGPT
- PYTHON
- Baekjoon
- 자연어처리
- 편스토랑 우승상품
- SW Expert Academy
- dacon
- Git
- hackerrank
- 맥북
- ubuntu
- gs25
- Docker
- 데이콘
- Kaggle
- 백준
- 편스토랑
- 캐치카페
- 더현대서울 맛집
- programmers
- 우분투
- 프로그래머스
- 금융문자분석경진대회
- 프로그래머스 파이썬
- AI 경진대회
- 코로나19
- leetcode
- 파이썬
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 1436. Destination City (Python) 본문
728x90
반응형
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 York","Lima"],["Lima","Sao Paulo"]]
Output: "Sao Paulo"
Explanation: Starting at "London" city you will reach "Sao Paulo" city which is the destination city. Your trip consist of: "London" -> "New York" -> "Lima" -> "Sao Paulo".
Example 2:
Input: paths = [["B","C"],["D","B"],["C","A"]]
Output: "A"
Explanation: All possible trips are:
"D" -> "B" -> "C" -> "A".
"B" -> "C" -> "A".
"C" -> "A".
"A".
Clearly the destination city is "A".
Example 3:
Input: paths = [["A","Z"]]
Output: "Z"
Constraints:
- 1 <= paths.length <= 100
- paths[i].length == 2
- 1 <= cityAi.length, cityBi.length <= 10
- cityAi != cityBi
- All strings consist of lowercase and uppercase English letters and the space character.
Solution
class Solution:
def destCity(self, paths: List[List[str]]) -> str:
start = set()
destination = set()
for path in paths:
start.add(path[0])
destination.add(path[1])
return list(destination-start)[0]
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 1678. Goal Parser Interpretation (Python) (0) | 2020.12.08 |
---|---|
[leetCode] 1588. Sum of All Odd Length Subarrays (Python) (0) | 2020.12.07 |
[leetCode] 744. Find Smallest Letter Greater Than Target (Python) (0) | 2020.12.05 |
[leetCode] 82. Remove Duplicates from Sorted List II (Python) (0) | 2020.12.02 |
[leetCode] 83. Remove Duplicates from Sorted List (Python) (0) | 2020.12.01 |
Comments