Class Solution
-
- All Implemented Interfaces:
public final class Solution1436 - Destination City.
Easy
You are given the array
paths, where <code>pathsi = cityA<sub>i</sub>, cityB<sub>i</sub></code> means there exists a direct path going from <code>cityA<sub>i</sub></code> to <code>cityB<sub>i</sub></code>. 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 <= 100paths[i].length == 2<code>1 <= cityA<sub>i</sub>.length, cityB<sub>i</sub>.length <= 10</code>
<code>cityA<sub>i</sub> != cityB<sub>i</sub></code>
All strings consist of lowercase and uppercase English letters and the space character.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-