1436. 旅行终点站 - 力扣（LeetCode）
class Solution {public String destCity(List<List<String>> paths) {HashSet<String> hs=new HashSet<>();for(int i=0;i<paths.size();i++){hs.add(paths.get(i).get(0));}for(int i=0;i<paths.size();i++){if(!hs.contains(paths.get(i).get(1))){return paths.get(i).get(1);}}return "";}
}class Solution(object):def destCity(self, paths):hs=set()for i in range(len(paths)):hs.add(paths[i][0])for i in range(len(paths)):if paths[i][1] not in hs:return paths[i][1]return ""
