[LeetCode] Number of Laser Beams in a Bank

2125. Number of Laser Beams in a Bank

Anti-theft security devices are activated inside a bank. You are given a 0-indexed binary string array bank representing the floor plan of the bank, which is an m x n 2D matrix. bank[i] represents the ith row, consisting of ‘0’s and ‘1’s. ‘0’ means the cell is empty, while’1’ means the cell has a security device.

There is one laser beam between any two security devices if both conditions are met:

  • The two devices are located on two different rows: r1 and r2, where r1 < r2.
  • For each row i where r1 < i < r2, there are no security devices in the ith row.

Laser beams are independent, i.e., one beam does not interfere nor join with another.

Return the total number of laser beams in the bank.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
int numberOfBeams(vector<string>& bank) {
int now = 0, next, res = 0;
for(auto& b : bank) {
next = accumulate(begin(b), end(b), 0, [](int sum, char ch){ return sum + (ch == '1');});
if(next) {
res += now * next;
now = next;
}
}
return res;
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/06/08/PS/LeetCode/number-of-laser-beams-in-a-bank/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.