6091. Divide the array so that the maximum difference is K

Ideas ：

  Prioritize , Then expand every possible interval , When the difference between the two ends of the interval exceeds Given range , Go directly to the next interval ;

class Solution {
public:
    int partitionArray(vector<int>& nums, int k) {
      int ans = 0;
      
      //  Sort the array first 
      sort(begin(nums), end(nums));
      
      //  The first element of the first subsequence 
      int start = nums[0];
      //  The default is a 
      ans = 1;
      
      for(int i = 1; i < nums.size(); i++){
        if(nums[i] - start <= k){
          //  If it is in the current sequence, skip 
          continue;
        }
        
        //  Not in the current sequence , Then record the beginning element of a sequence 
        start = nums[i];
        //  Sequence number accumulation 
        ans++;
      }
      
      return ans;
    }
};