Count Binary Substrings LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countBinarySubstrings(string s) {
4
    int prev = 0;
5
    int curr = 1;
6
    int sum = 0;
7

8
    for (int i = 1; i < s.length(); i++) {
9
      if (s[i] == s[i - 1]) {
10
        curr++;
11
      } else {
12
        sum += min(prev, curr);
13
        prev = curr;
14
        curr = 1;
15
      }
16
    }
17

18
    sum += min(prev, curr);
19
    return sum;
20
  }
21
};