https://i.imgur.com/HxG7TRf.png
我要冲击徽章了 家人们
第一题:
每一次都(max+min)/2
求最小的
思路:
sort 然后姆咪
```cpp
class Solution {
public:
double minimumAverage(vector<int>& nums)
{
sort(nums.begin(),nums.end());
int len = nums.size();
vector<double> paper;
for(int i = 0 ; i < len/2 ; i ++)
{
paper.push_back( ((double)nums[i] + (double)nums[len-i-1])/2.0 );
}
double p = paper[0];
for(int i = 0 ; i < len/2 ; i ++)
{
p = min(paper[i],p);
}
return p;
}
};
```
第二题:
找一个矩形把所有1都覆蓋
思路:
上下左右往中间找
我好像写超丑
```cpp
class Solution {
public:
int minimumArea(vector<vector<int>>& grid)
{
int n = grid.size();
int m = grid[0].size();
int u = 0;
int d = n-1;
int l = 0;
int r = m-1;
for( ; u < n ; u ++ )
{
int ok = 0;
for(int i = 0 ; i < m ; i ++)
{
if(grid[u][i] == 1)ok = 1;
}
if(ok)break;
}
for( ; d >= 0 ; d