1
class Solution {
2

3
  public int partitionArray(int[] nums, int k) {
4
    Arrays.sort(nums);
5
    int c = 1, prev = 0;
6
    for (int i = 0; i < nums.length; i++) {
7
      if (nums[i] - nums[prev] <= k) continue;
8
      c++;
9
      prev = i;
10
    }
11
    return c;
12
  }
13
}