Destination City
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"Starting at "London", you reach "Sao Paulo" via "London" -> "New York" -> "Lima" -> "Sao Paulo", so "Sao Paulo" is the destination city.
Example 2
Input
paths = [["B","C"],["D","B"],["C","A"]]Output
"A"All possible trips eventually end at "A", and "A" has no outgoing path.
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.