leetcode

0 class Solution {

1 public:

2 int partitionArray(vector<int> &nums, int k) {

3 sort(begin(nums), end(nums));

4

5 int res = 1, j = 0;

6 for (int i = 1; i < nums.size(); i++) {

7 if (nums[i] - nums[j] > k) j = i, res++;

8 }

9 return res;

10 }

11 };