medium上下限真的差滿多的
graph之類的超難 其他就
對ㄚ
class Solution {
public:
vector<vector<int>> divideArray(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
int n=nums.size();
vector<vector<int>> ans;
if (n%3) return {};
for(int i=0; i+2<n; i+=3){
if(nums[i+2]-k>nums[i]) return {};
ans.push_back({nums[i], nums[i+1], nums[i+2]});
}
return ans;
}
};