public class Solution

    {

        public int CountBinarySubstrings(string s)

        {

            //s = "00110011";

            //这道题的思路是先找到分割点，然后用分割点，向两边同时搜索，找到连续串

            var len = s.Length;

            if (len < )

            {

                return ;

            }

            var sum = ;

            var last = s[].ToString();

            for (int i = ; i < len; i++)

            {

                var cur = s[i].ToString();

                if (cur != last)

                {

                    int a = i - ;//向左

                    int b = i;//向右

                    while (a >=  && b <= len - )

                    {

                        var left = s[a].ToString();

                        var right = s[b].ToString();

                        if (last == left && cur == right)

                        {

                            sum++;

                            last = left;

                            cur = right;

                            a--;

                            b++;

                        }

                        else

                        {

                            break;

                        }

                    }

                }

                last = s[i].ToString();

            }

            return sum;

        }

    }