摘要: Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in th 阅读全文
posted @ 2017-10-24 10:05 __Meng 阅读(215) 评论(0) 推荐(0) 编辑