696. Count Binary Substrings
2017-10-24 10:05
190 查看
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 these substrings are grouped consecutively.
Substrings that occur multiple times are counted the number of times they occur.
Example 1:
Input: "00110011" Output: 6
Input: "10101" Output: 4
计算具有相同数量的0和1的子字符串的数量,0,1要连续
C++(42ms):
1 class Solution { 2 public: 3 int countBinarySubstrings(string s) { 4 vector<int> vec ; 5 int res = 0 ; 6 int count = 1 ; 7 for(int i = 1 ; i <= s.size() ; i++){ 8 if (s[i] == s[i-1]){ 9 count++ ; 10 }else{ 11 vec.push_back(count) ; 12 count = 1 ; 13 } 14 } 15 for(int i = 1 ; i < vec.size() ; i++){ 16 res += min(vec[i],vec[i-1]) ; 17 } 18 return res ; 19 } 20 };
Java(61ms):
1 class Solution { 2 public int countBinarySubstrings(String s) { 3 ArrayList<Integer> list = new ArrayList() ; 4 int count = 1 ; 5 for(int i = 1 ; i < s.length() ; i++){ 6 if (s.charAt(i) == s.charAt(i-1)){ 7 count++ ; 8 }else{ 9 list.add(count) ; 10 count = 1 ; 11 } 12 } 13 list.add(count) ; 14 int res = 0 ; 15 for(int i = 1 ; i < list.size() ; i++){ 16 17 res += Math.min((int)list.get(i),(int)list.get(i-1)) ; 18 } 19 return res ; 20 } 21 }
相关文章推荐
- 696. Count Binary Substrings
- 696. Count Binary Substrings
- LeetCode-696-Count Binary Substringss-E
- 696. Count Binary Substrings
- leetcode 696 Count Binary Substrings
- 696. Count Binary Substrings
- 696. Count Binary Substrings
- Leetcode 696 Count Binary Substrings
- 东大OJ-1040-Count-快速幂方法求解斐波那契-
- [Big Data]菜鸟的Hadoop (Before YARN) 学习笔记 (一) WordCount
- Count and Say leetcode java
- java select count(case when)
- ZOJ 1610 Count the Colors (线段树 成段更新)
- hadoop 2.7.3伪分布式环境运行官方wordcount
- [BZOJ2588] Count on a tree
- @@ROWCOUNT 含义
- BZOJ 2588: Spoj 10628. Count on a tree
- sql中count(0),count(1),count(),count(列名)
- hdu 3336 Count the string(数据结构:KMP)
- idea+maven+scala创建wordcount,打包jar并在spark on yarn上运行