count-asterisks

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a string <code>s</code>, where every two consecutive vertical bars <code>&#39;|&#39;</code> are grouped into a pair. In other words, the 1st and 2nd <code>&#39;|&#39;</code> make a pair, the 3rd and 4th <code>&#39;|&#39;</code> make a pair, and so forth.

Return the number of <code>&#39;*&#39;</code> in <code>s</code>, excluding the <code>&#39;*&#39;</code> between each pair of <code>&#39;|&#39;</code>.

Note that each <code>&#39;|&#39;</code> will belong to exactly one pair.

&nbsp;
Example 1:

<pre>
Input: s = &quot;l|*e*et|c**o|*de|&quot;
Output: 2
Explanation: The considered characters are underlined: &quot;l|*e*et|c**o|*de|&quot;.
The characters between the first and second &#39;|&#39; are excluded from the answer.
Also, the characters between the third and fourth &#39;|&#39; are excluded from the answer.
There are 2 asterisks considered. Therefore, we return 2.</pre>

Example 2:

<pre>
Input: s = &quot;iamprogrammer&quot;
Output: 0
Explanation: In this example, there are no asterisks in s. Therefore, we return 0.
</pre>

Example 3:

<pre>
Input: s = &quot;yo|uar|e**|b|e***au|tifu|l&quot;
Output: 5
Explanation: The considered characters are underlined: &quot;yo|uar|e**|b|e***au|tifu|l&quot;. There are 5 asterisks considered. Therefore, we return 5.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists of lowercase English letters, vertical bars <code>&#39;|&#39;</code>, and asterisks <code>&#39;*&#39;</code>.</li>
	<li><code>s</code> contains an even number of vertical bars <code>&#39;|&#39;</code>.</li>
</ul>

countAsterisks

Count Asterisks

String

给你一个字符串&nbsp;<code>s</code>&nbsp;，每&nbsp;两个&nbsp;连续竖线&nbsp;<code>'|'</code>&nbsp;为 一对&nbsp;。换言之，第一个和第二个&nbsp;<code>'|'</code>&nbsp;为一对，第三个和第四个&nbsp;<code>'|'</code>&nbsp;为一对，以此类推。

请你返回 不在 竖线对之间，<code>s</code>&nbsp;中&nbsp;<code>'*'</code>&nbsp;的数目。

注意，每个竖线&nbsp;<code>'|'</code>&nbsp;都会 恰好&nbsp;属于一个对。

&nbsp;

示例 1：

<pre>输入：s = "l|*e*et|c**o|*de|"
输出：2
解释：不在竖线对之间的字符加粗加斜体后，得到字符串："l|*e*et|c**o|*de|" 。
第一和第二条竖线 '|' 之间的字符不计入答案。
同时，第三条和第四条竖线 '|' 之间的字符也不计入答案。
不在竖线对之间总共有 2 个星号，所以我们返回 2 。</pre>

示例 2：

<pre>输入：s = "iamprogrammer"
输出：0
解释：在这个例子中，s 中没有星号。所以返回 0 。
</pre>

示例 3：

<pre>输入：s = "yo|uar|e**|b|e***au|tifu|l"
输出：5
解释：需要考虑的字符加粗加斜体后："yo|uar|e**|b|e***au|tifu|l" 。不在竖线对之间总共有 5 个星号。所以我们返回 5 。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code>&nbsp;只包含小写英文字母，竖线&nbsp;<code>'|'</code>&nbsp;和星号&nbsp;<code>'*'</code>&nbsp;。</li>
	<li><code>s</code>&nbsp;包含 偶数&nbsp;个竖线&nbsp;<code>'|'</code> 。</li>
</ul>