Maximum Number of Distinct Elements After Operations

arraygreedysorting

You are given an integer array nums and an integer k .

You are allowed to perform the following operation on each element of the array at most once :

Add an integer in the range [-k, k] to the element.

Return the maximum possible number of distinct elements in nums after performing the operations .

Example 1

Input: nums = [1,2,2,3,3,4], k = 2
Output: 6
nums changes to [-1, 0, 1, 2, 3, 4] after performing operations on the first four elements.

Example 2

Input: nums = [4,4,4,4], k = 1
Output: 3
By adding -1 to nums[0] and 1 to nums[1] , nums changes to [3, 5, 4, 4] .

1 <= nums.length <= 10 ^5

1 <= nums[i] <= 10 ^9

0 <= k <= 10 ^9

🤔

Medium

Difficulty

Topic Info

ModuleDSA

CategoryArray

Sub-topicGreedy