Maximum Number of Distinct Elements After Operations

You are given an array nums and an integer k.
For every element in the array, you may change it at most once by adding any integer value between -k and k (inclusive).
Your goal is to maximize the number of unique (distinct) values in the array after optionally modifying the elements.

Return the maximum possible count of distinct numbers you can achieve.