C++ Simple and Clean 7-Line Solution
\nclass Solution {\npublic:\n    int getMaxDiff(vector<int>& v, int len) {\n        sort(v.begin(), v.end());\n        int max_diff = v[0];\n        \n        f
```\nclass Solution {\npublic:\n    int getMaxDiff(vector<int>& v, int len) {\n        sort(v.begin(), v.end());\n        int max_diff = v[0];\n        \n        for (int i = 1; i < v.size(); i++)\n            max_diff = max(max_diff, v[i]-v[i-1]);\n        \n        max_diff = max(max_diff, len - v.back());\n        return max_diff;\n    }\n    \n    int maxArea(int h, int w, vector<int>& horizontalCuts, vector<int>& verticalCuts) {\n        return (long)getMaxDiff(horizontalCuts, h) * getMaxDiff(verticalCuts, w) % 1000000007;\n    }\n};\n```\n**Like it? please upvote!**
['C']