class Solution {
public:
int maxDistToClosest(vector<int>& seats) {
vector<int>v;
for(int i = 0;i<seats.size();i++)
{
if(seats[i]) v.push_back(i);
}
int Max = v[0]> seats.size()-1 - v[(v.size()-1)] ? v[0]:seats.size()-1 - v[(v.size()-1)];
for(int i = 1;i<v.size();i++)
{
int t = (v[i] + v[i-1])/2;
Max = max(Max,min(t - v[i-1],v[i] - t));
}
return Max;
}
};
俺也一样!