[LeetCode] 696. Count Binary Substrings - Java

• 문제 링크

Count Binary Substrings - LeetCode

 

• 풀이 코드

public class Solution {

    public int countBinarySubstrings(String s) {
        int sum = 0, prev = 0, cur = 1;
        for (int i = 1, n = s.length(); i < n; i++) {
            if (s.charAt(i - 1) == s.charAt(i)) cur++;
            else {
                sum += Math.min(prev, cur);
                prev = cur;
                cur = 1;
            }
        }

        return sum + Math.min(prev, cur);
    }

}