Given an array of integers, find the longest subset where the absolute difference between any two elements is less than or equal to .
Example
There are two subset meeting the criterion: and . The maximum length subset has elements.
Function Description
Complete the pickingNumbers function in the editor below.
pickingNumbers has the following parameter(s):
- int a[n]: an array of integers
Returns
- int: the length of the longest subset that meets the criterion
Input Format
The first line contains a single integer , the size of the array .
The second line contains space-separated integers, each an .
Constraints
- The answer will be .