Minimum Index Sum of Two Lists LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<string> findRestaurant(vector<string> &list1, vector<string> &list2) {
4
    int min = INT_MAX;
5
    unordered_map<string, int> un;
6
    vector<string> v;
7
    for (int i = 0; i < list1.size(); i++) {
8
      un[list1[i]] = i;
9
    }
10
    for (int i = 0; i < list2.size(); i++) {
11
      if (un.count(list2[i]) != 0) {
12
        int sum = i + un[list2[i]];
13
        if (sum < min) {
14
          min = sum;
15
          v.clear();
16
          v.push_back(list2[i]);
17
        } else if (sum == min) {
18
          v.push_back(list2[i]);
19
        }
20
      }
21
    }
22
    return v;
23
  }
24
};