434. Number of Segments in a String

标签：style   segment   fine   seq   bsp   col   rac   count   amp   

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.

Please note that the string does not contain any non-printable characters.

Example:

Input: "Hello, my name is John"
Output: 5


输出字符串一共有几段


C++（3ms）：

 1 class Solution {
 2 public:
 3     int countSegments(string s) {
 4         int res = 0 ;
 5         s.push_back(‘ ‘) ;
 6         for (int i = 1 ; i < s.length() ; i++){
 7             if (s[i] == ‘ ‘ && s[i-1] != ‘ ‘)
 8                 res++ ;
 9         }
10         return res ;
11        
12     }
13 };

434. Number of Segments in a String

标签：style   segment   fine   seq   bsp   col   rac   count   amp   

原文地址：http://www.cnblogs.com/-Buff-/p/7678563.html