leetcode

0 class Solution {

1 public:

2 int findValueOfPartition(vector<int> &nums) {

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

4 int res = INT_MAX;

5 for (int i = 1; i < nums.size(); i++)

6 res = min(res, nums[i] - nums[i - 1]);

7 return res;

8 }

9 };