Maximum Number of People That Can Be Caught in Tag — C++

// Time:  O(n)
// Space: O(1)

// greedy with two pointers solution
class Solution {
public:
    int catchMaximumAmountofPeople(vector<int>& team, int dist) {
        int result = 0, i = 0, j = 0;
        while (i < size(team) && j < size(team)) {
            if (i + dist < j || team[i] != 1) {
                ++i;
            } else if (j + dist < i || team[j] != 0) {
                ++j;
            } else {
                ++result;
                ++i;
                ++j;
            }
        }
        return result;
    }
};

// Time:  O(n)
// Space: O(1)
// greedy with sliding window solution
class Solution2 {
public:
    int catchMaximumAmountofPeople(vector<int>& team, int dist) {
        int result = 0;
        for (int i = 0, j = 0; i < size(team); ++i) {
            if (team[i] == 0) {
                continue;
            }
            for (; j < i - dist; ++j);
            for (; j <= min(i + dist, static_cast<int>(size(team)) - 1) && team[j] != 0; ++j);
            if (j <= min(i + dist, static_cast<int>(size(team)) - 1)) {
                ++result;
                ++j;
            }
        }
        return result;
    }
};