Next Greater Element I LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> nextGreaterElement(vector<int> &nums1, vector<int> &nums2) {
4
    vector<int> vc;
5
    int len1 = nums1.size();
6
    int len2 = nums2.size();
7
    unordered_map<int, int> ump;
8
    int e, f;
9
    for (e = 0; e < len2; e++) {
10
      for (f = e + 1; f < len2; f++) {
11
        if (nums2[f] > nums2[e]) {
12
          ump[nums2[e]] = nums2[f];
13
          break;
14
        }
15
      }
16
      if (f == len2) ump[nums2[e]] = -1;
17
    }
18
    unordered_map<int, int>::iterator it;
19
    for (int e = 0; e < len1; e++) {
20
      it = ump.find(nums1[e]);
21
      if (it != ump.end()) {
22
        vc.push_back(it->second);
23
      }
24
    }
25

26
    return vc;
27
  }
28
};