problem no 18: number of buildings that can see the sun . ( or facing the sun.)
QUESTION:
Given an array H
representing heights of buildings. You have to count the buildings which
will see the sunrise (Assume : Sun rise on the side of array starting
point).
Example 1:
Input:
N = 5
H[] = {7, 4, 8, 2, 9}
Output: 3
Explanation: As 7 is the first element, it
can see the sunrise. 4 can't see the
sunrise as 7 is hiding it. 8 can see.
2 can't see the sunrise. 9 also can see
the sunrise.
Example 2:
Input:
N = 4
H[] = {2, 3, 4, 5}
Output: 4
Explanation: As 2 is the first element, it
can see the sunrise. 3 can see the
sunrise as 2 is not hiding it. Same for 4
and 5, they also can see the sunrise.
ANSWER:
int countBuildings(int h[], int n) {
int count=0;
int max=INT_MIN;
for(int i=0;i<n;i++)
{
if(h[i]>max)
{
count=count+1;
max=h[i];
}
}
return count;
}
Comments
Post a Comment