📃 题目描述

题目链接：696. 计数二进制子串 (opens new window)

🔔 解题思路

class Solution {
    public int countBinarySubstrings(String s) {
        // 记录每个连续数字串的数量
        List<Integer> counts = new ArrayList<>();
        int left = 0, right = 0;
        while (right < s.length()) {
            if (s.charAt(right) == s.charAt(left)) {
                right ++;
            }
            else {
                counts.add(right - left);
                left = right;
            }
        }
        counts.add(right - left);

        int res = 0;
        for (int i = 0; i < counts.size() - 1; i ++) {
            res += Math.min(counts.get(i), counts.get(i + 1));
        }

        return res;
    }
}

💥 复杂度分析

• 空间复杂度：
• 时间复杂度：