class Solution {
public:
int findValueOfPartition(vector<int>& nums) {
int n = nums.size();
int res = INT_MAX;
sort(nums.begin(),nums.end());
for(int i = 1; i < n; ++i){
res = min(res, nums[i] - nums[i - 1]); //转换成求nums中两个数的最小差值
}
return res;
}
};
LeetCode 2740. 找出分区值
最新推荐文章于 2024-07-26 20:15:12 发布