C++实现冒泡排序从大到小排序并去重

```cpp #include <iostream> #include <vector> #include <algorithm> int main() { int n; std::cin >> n; std::vector<int> nums(n); for (int i = 0; i < n; ++i) { std::cin >> nums[i]; } // 冒泡排序 for (int i = 0; i < n - 1; ++i) { for (int j = 0; j < n - i - 1; ++j) { if (nums[j] < nums[j + 1]) { std::swap(nums[j], nums[j + 1]); } } } // 去重 auto last = std::unique(nums.begin(), nums.end()); nums.erase(last, nums.end()); // 输出结果 for (int i = 0; i < nums.size(); ++i) { if (i > 0) std::cout << " "; std::cout << nums[i]; } std::cout << std::endl; return 0; } ``` ######[AI问答 | 286点数解答 | 2026-04-12 08:30:03]