class Solution {
public:
int maxArea(vector<int>& height) {
int n = height.size();
int left = 0;
int right = n - 1;
int ans = INT_MIN;
while (left <= right)
{
ans = max(ans, (right - left) * min(height[left], height[right]));
if (height[left] < height[right])
{
left++;
}
else
{
right--;
}
}
return ans;
}
};
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int maxlen = 0;
for (string str : strs)
maxlen = max((int)str.length(), maxlen);
int n = strs.size();
int len = 1;
for (; len <= maxlen; len++)
{
int i = 1;
while (i < n && strs[i][len - 1] == strs[0][len - 1]) i++;
if (i < n) break;
}
return maxlen == 0 ? "" : strs[0].substr(0, len - 1);
}
};