classSolution{publicStringdestCity(List<List<String>> paths){//我的垃圾算法,勿careif(paths ==null){returnnull;}int flag =0;for(int i =0; i < paths.size(); i++){for(List<String> path : paths){if(paths.get(i).get(1).equals(path.get(0))){
flag =1;break;}}if(flag ==0){return paths.get(i).get(1);}
flag =0;}returnnull;}}