leetcode

0 class Solution {

1 public:

2 string destCity(vector<vector<string>> &paths) {

3 unordered_map<string, int> um;

4 for (auto &path : paths) {

5 um[path[0]]--;

6 um[path[1]]++;

7 }

8 for (auto &[k, v] : um)

9 if (v == 1) return k;

10 return "";

11 }

12 };