Home Weekly and Biweekly Contests | June | Leetcode
Post
Cancel

Weekly and Biweekly Contests | June | Leetcode

Biweekly Contest 81

2315. Count Asterisks

You are given a string s, where every two consecutive vertical bars $’’$ are grouped into a pair. In other words, the 1st and 2nd $’’$ make a pair, the 3rd and 4th $’’$ make a pair, and so forth.
Return the number of $’’$ in s, excluding the $’’$ between each pair of $’’$.
Note that each $’’$ will belong to exactly one pair.
1
2
3
4
5
6
7
8
9
10
int countAsterisks(string s) {  
    int ans(0), bars(0);        
    for(char ch:s){
        if(ch == '|')
            bars++;
        if(ch == '*' and bars%2 == 0)
            ans++;
        }        
    return ans; 
}
This post is licensed under CC BY 4.0 by the author.

Weekly and Biweekly Contests | July | Leetcode

Weekly and Biweekly Contests | March | Leetcode