leetcode

0 class Solution {

1 public:

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

3 vector<vector<int>> res;

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

5 for (int i = 0; i < size(nums); i += 3) {

6 if (nums[i + 2] - nums[i] > k) return {};

7 res.push_back({nums[i], nums[i + 1], nums[i + 2]});

8 }

9 return res;

10 }

11 };