Maximum Product of Word Lengths LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxProduct(vector<string> &words) {
4
    vector<unordered_set<char>> st;
5
    int res = 0;
6
    for (string s : words) {
7
      unordered_set<char> temp;
8
      for (char c : s) {
9
        temp.insert(c);
10
      }
11
      st.push_back(temp);
12
    }
13
    for (int i = 0; i < words.size(); i++) {
14
      for (int j = 0; j < i; j++) {
15
        bool flag = false;
16
        for (auto val : st[i]) {
17
          if (st[j].find(val) != st[j].end()) {
18
            flag = true;
19
            break;
20
          }
21
        }
22
        if (flag == false) {
23
          int prd = words[i].length() * words[j].length();
24
          res = max(res, prd);
25
        }
26
      }
27
    }
28
    return res;
29
  }
30
};