C++ 实现序列去重：仅保留首次出现元素的巧妙算法

```cpp #include <iostream> #include <vector> #include <unordered_set> std::vector<int> removeDuplicates(const std::vector<int>& nums) { std::unordered_set<int> seen; std::vector<int> result; for (int num : nums) { if (seen.find(num) == seen.end()) { seen.insert(num); result.push_back(num); } } return result; } int main() { std::vector<int> nums = {1, 2, 2, 3, 4, 4, 4, 5}; std::vector<int> uniqueNums = removeDuplicates(nums); for (int num : uniqueNums) { std::cout << num << " "; } std::cout << std::endl; return 0; } ``` ######[AI问答 | 206点数解答 | 2026-02-07 21:04:26]