2315.统计星号

Author: w2xi

README.md

@@ -206,6 +206,7 @@
 |2293|[极大极小游戏](https://leetcode.cn/problems/min-max-game/)|[JavaScript](./algorithms/min-max-game.js)|Easy|
 |2299|[强密码检验器 II](https://leetcode.cn/problems/strong-password-checker-ii/)|[JavaScript](./algorithms/strong-password-checker-ii.js)|Easy|
 |2309|[兼具大小写的最好英文字母](https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/)|[JavaScript](./algorithms/greatest-english-letter-in-upper-and-lower-case.js)|Easy|
+|2315|[统计星号](https://leetcode.cn/problems/count-asterisks/)|[JavaScript](./algorithms/count-asterisks.js)|Easy|
 |2351|[第一个出现两次的字母](https://leetcode.cn/problems/first-letter-to-appear-twice/)|[JavaScript](./algorithms/first-letter-to-appear-twice.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|

algorithms/count-asterisks.js

@@ -0,0 +1,23 @@
+/**
+ * 2315. 统计星号
+ * @param {string} s
+ * @return {number}
+ */
+var countAsterisks = function(s) {
+  let count = 0;
+  let j = 0;
+  
+  for (let i = 0; i < s.length; i++) {
+    if (s[i] === '|') {
+      j++;
+      if (j === 2) {
+        // reset
+        j = 0
+      }
+    }
+    if (s[i] === '*' && j === 0) {
+      count++;
+    }
+  }
+  return count;
+};

vs-lt/2315.统计星号.js

@@ -0,0 +1,31 @@
+/*
+ * @lc app=leetcode.cn id=2315 lang=javascript
+ *
+ * [2315] 统计星号
+ */
+
+// @lc code=start
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var countAsterisks = function(s) {
+  let count = 0;
+  let j = 0;
+  
+  for (let i = 0; i < s.length; i++) {
+    if (s[i] === '|') {
+      j++;
+      if (j === 2) {
+        // reset
+        j = 0
+      }
+    }
+    if (s[i] === '*' && j === 0) {
+      count++;
+    }
+  }
+  return count;
+};
+// @lc code=end
+