maximum product of three numbers

Input: [1,2,3]
Output: 6

Input: [1,2,3,4]
Output: 24

1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int s = nums.size() - 1;
        if (nums[0] < 0 && nums[1] < 0) {
            return max(nums[0] * nums[1] * nums[s], nums[s] * nums[s - 1] * nums[s - 2]);
        }

        return nums[s] * nums[s - 1] * nums[s - 2];
    }
};