C++ find 2 closest adjacent numbers
We may cut the array into 2 parts so that max of part 1 is adjacent to min of second ( that means we will cut the sorted array by mid of that adjacent numbers) 
We may cut the array into 2 parts so that max of part 1 is adjacent to min of second ( that means we will cut the sorted array by mid of that adjacent numbers) \nSo the problem is about findig closest adjacent numbers in sorted array.\n```\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n        sort(begin(nums),end(nums));\n        int min = INT_MAX;\n        for(int i = 1;i<nums.size();++i)\n        {\n            min= std::min(min,nums[i]-nums[i-1]);\n        }\n        return min;\n    }\n};\n```
['C++']