Skip to content

Commit b215b89

Browse files
Day 10-q1 solution added
1 parent d1ecd58 commit b215b89

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# Approach:
2+
Number of beams=number of lasers in current row * number of beams in next non-empty row
3+
```
4+
class Solution {
5+
public:
6+
int numberOfBeams(vector<string>& bank) {
7+
int count=0;
8+
int prev=0;
9+
for(int i=0;i<bank.size();i++){
10+
int curr=0;
11+
for (char c:bank[i]){
12+
if (c=='1'){
13+
curr+=1;
14+
}
15+
}
16+
if (curr>0){
17+
count+=curr*prev;
18+
prev=curr;
19+
}
20+
}
21+
return count;
22+
}
23+
};
24+
```

0 commit comments

Comments
 (0)