暴力求解,61/63,超时了。
class Solution {
public:
// 3, [1,2 all turn on] and [5,6,7 not turned on]
int numTimesAllBlue(vector<int>& light) {
int count = 0;
vector<int> visit(light.size(),0); // [0,0,0,0,0, 0] // turn lignt[i]
for(int i=0;i<light.size();i++){
int turnon = light[i]-1;
visit[turnon] = 1;
int flag = 1;
for(int j=0;j<turnon;j++){
if (visit[j]==0){
flag = 0;
break;
}
}
int k = turnon;
while(k<visit.size()&&visit[k]==1){
k++;
}
for(int j=k;j<visit.size();j++){
if (visit[j]==1){
flag = 0;
break;
}
}
if (flag == 1){
count ++;
}
}
return count;
}
};
参考答案,发现了别人的优秀解法,灯全变蓝当且仅当最右侧灯的id==目前点亮灯的数量时,才会全变蓝色。很机智啊。
class Solution {
public:
int numTimesAllBlue(vector<int>& light) {
int count = 0;
int right = 0;
for(int i=0;i<light.size();i++){
right = max(right, light[i]);
if (i+1==right){
count ++;
}
}
return count;
}
};