Last Moment Before All Ants Fall Out of a Plank LeetCode solution in C++

1
class Solution {
2
 public:
3
  int getLastMoment(int n, vector<int> &left, vector<int> &right) {
4
    int mx = 0;
5
    for (auto &i : left) mx = max(mx, i);
6
    for (auto &i : right) mx = max(mx, n - i);
7
    return mx;
8
  }
9
};