2021-07-18计数二进制字串

力扣

class Solution {
public:
    int countBinarySubstrings(string s) {
        int ptr = 0, n = s.size(), last = 0, ans = 0;
        while (ptr < n) {
            char c = s[ptr];
            int count = 0;
            while (ptr < n && s[ptr] == c) {
                ++ptr;
                ++count;
            }
            ans += min(count, last);
            last = count;
        }
        return ans;
    }
};


 class Solution {
 public:
     int countBinarySubstrings(string s) {
         vector<int> counts;
         int ptr = 0, n = s.size();
         while (ptr < n) {
             char c = s[ptr];
             int count = 0;
             while (ptr < n && s[ptr] == c) {
                 ++ptr;
                 ++count;
             }
             counts.push_back(count);
         }
         int ans = 0;
         for (int i = 1; i < counts.size(); ++i) {
             ans += min(counts[i], counts[i - 1]);
         }
         return ans;
     }
 };