C# solution 100% runtime
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(2n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public IList<int> LastVisitedIntegers(int[] nums) {\n        var ans = new List<int>();\n        var seen = new List<int>();\n        int k = 0;\n        int n = nums.Length;\n        for(int i = 0; i < n; i++)\n        {\n            if(nums[i] != -1)\n            {\n                k = 0;\n                seen.Insert(0, nums[i]);\n            }\n            else\n            {\n                k++;\n                if(k <= seen.Count)\n                    ans.Add(seen[k - 1]);\n                else\n                    ans.Add(-1);\n            }\n        }\n\n        return ans;\n    }\n}\n```
['C#']