add 2125

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) ||Medium||
 |2124|[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) ||Easy||
 |2120|[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) ||Medium||
 |2119|[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) ||Easy||

src/main/java/com/fishercoder/solutions/_2125.java

@@ -0,0 +1,42 @@
+package com.fishercoder.solutions;
+
+public class _2125 {
+    public static class Solution1 {
+        public int numberOfBeams(String[] bank) {
+            int ans = 0;
+            for (int i = 0; i < bank.length; ) {
+                String currRow = bank[i];
+                if (currRow.indexOf('1') == -1) {
+                    i++;
+                    continue;
+                }
+                int num1 = 0;
+                for (char c : currRow.toCharArray()) {
+                    if (c == '1') {
+                        num1++;
+                    }
+                }
+                i++;
+                while (i < bank.length) {
+                    if (bank[i].indexOf('1') == -1) {
+                        i++;
+                    } else {
+                        break;
+                    }
+                }
+                int num2 = 0;
+                if (i >= bank.length) {
+                    break;
+                } else {
+                    for (char c : bank[i].toCharArray()) {
+                        if (c == '1') {
+                            num2++;
+                        }
+                    }
+                }
+                ans += num1 * num2;
+            }
+            return ans;
+        }
+    }
+}