leetcode-----3397

Maximum Number of Distinct Elements After Operations //code in C++ class Solution { public: int maxDistinctElements(vector& nums, int k) { sort(nums.begin(), nums.end()); int cnt = 0, prev = INT_MIN; for (int num : nums) { int curr = min(max(num - k, prev + 1), num + k); if (curr > prev) { cnt++; prev = curr; } } return cnt; } };