2733. Neither Minimum nor Maximum

Given an integer array nums containing distinct positive integers, find and return any number from the array that is neither the minimum nor the maximum value in the array, or -1 if there is no such number.

Return the selected integer.

class Solution {
public:
    int findNonMinOrMax(vector<int>& nums) {
        sort(begin(nums), end(nums));
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] == nums[0] or nums[i] == nums.back()) continue;
            return nums[i];
        }
        return -1;
    }
};