一、此方法暴力,并不能AC ,时间超过限制
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> nums3;
int len1=nums1.size();
int len2=nums2.size();
int len=len1+len2;
for(int i=0,i1=0,i2=0;i<len;++i){
if(i1==len1){
nums3.push_back(nums2[i2]);
i2++;
}else if(i2==len2){
nums3.push_back(nums1[i1]);
i1++;
}else{
if(nums1[i1]<nums2[i2]){
nums3.push_back(nums1[i1]);
i1++;
}else{
nums3.push_back(nums2[i2]);
i2++;
}
}
}
if(len%2!=0){
return nums3[len/2];
}else {
int l=len/2;
return (nums3[l - 1] + nums3[l]) / 2.0;
}
}
};
int main(){
Solution s;
vector<int> a={1,3};
vector<int> b={2};
double c=s.findMedianSortedArrays(a,b);
cout<<c;
return 0;
}
二、优化之后,此方法可以AC。从两头开始寻找,如果左边的更低就左边的向右移,反之右边的向左移,不断记录最大的,知道相遇。
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
class Solution {
public:
int maxArea(vector<int>& height) {
int left = 0;
int right = height.size()- 1;
int totalwater = min(height[left],height[right])*(right-left);
while (left < right){
if (height[left] < height[right]) ++left;
else --right;
totalwater = max(totalwater, min(height[left], height[right]) * (right - left));
}
return totalwater;
}
};
int main(){
Solution s;
vector<int> a = { 1, 8, 6, 2, 5, 4, 8, 3, 7 };
int c = s.maxArea(a);
cout << c;
return 0;
}