easiest c++ soution
class Solution {\npublic:\n    int maximumProduct(vector<int>& nums) {\n        sort(nums.rbegin(),nums.rend());\n        int l=nums.size();\n      if(nums[0]*n
```class Solution {\npublic:\n    int maximumProduct(vector<int>& nums) {\n        sort(nums.rbegin(),nums.rend());\n        int l=nums.size();\n      if(nums[0]*nums[1]*nums[2]>nums[0]*nums[l-1]*nums[l-2]){\n          return nums[0]*nums[1]*nums[2];\n      }\n        else{\n            return nums[0]*nums[l-1]*nums[l-2];\n        }\n    }\n};```
[]