C++ solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. --> 

# Approach
<!-- Describe your approach to solving the problem. --> 

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    vector<int> lastVisitedIntegers(vector<int>& nums) {
        vector<int> ans;
        int seen[101];
        int seen_real_size = 0;
        int k = 0;
        for (int i = 0; i < nums.size(); ++i)
        {
            if (nums[i] != -1)
            {
                seen[seen_real_size] = nums[i];
                ++seen_real_size;
                k = 0;
            }
            else
            {
                k++;
                if (k <= seen_real_size) ans.push_back(seen[seen_real_size-k]);
                else ans.push_back(-1);
            }
        }
        return ans;
    }
};
```
['C++']