Count Binary Substrings LeetCode solution in Java

1
class Solution {
2
  public int countBinarySubstrings(String s) {
3
    int i, prevRunLength = 0, curRunLength = 1, count = 0;
4
    for (i = 1; i < s.length(); i++) {
5
      if (s.charAt(i) == s.charAt(i - 1)) {
6
        curRunLength++;
7
      } else {
8
        prevRunLength = curRunLength;
9
        curRunLength = 1;
10
      }
11
      if (prevRunLength >= curRunLength) {
12
        count++;
13
      }
14
    }
15
    return count;
16
  }
17
}