c++(0ms) one pass
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> t, ans;
    for(int i = 0; i != nums.size();)
      if(nums[i] == -1)
        for(int k = 1; i != nums.size() && nums[i] == -1; ++i, ++k)
          if(k > t.size()) ans.push_back(-1);
          else ans.push_back(t[t.size() - k]);  
      else t.push_back(nums[i++]);

    return ans;  
  }
};
```
['C++']