532. K-diff Pairs in an Array

简单题，直接处理就好

class Solution {public:    int findPairs(vector<int>& nums, int k) {        if(nums.size()<2)            return 0;        sort(nums.begin(),nums.end());        int count=0;        int index1=0;        int index2=index1+1;        while(index2<nums.size())        {            while(index2<nums.size()&&nums[index2]<nums[index1]+k)                index2++;            if(nums[index2]==nums[index1]+k)                count++;            int temp=index1+1;            while(temp<nums.size()&&nums[index1]==nums[temp])                temp++;            index1=temp;            index2=index1+1;        }        return count;    }};