zoukankan      html  css  js  c++  java
  • Leetcode: Number of Segments in a String

    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

     用split()

     1 public class Solution {
     2     public int countSegments(String s) {
     3         if (s==null || s.length()==0) return 0;
     4         String[] strs = s.split(" ");
     5         int count = 0;
     6         for (String str : strs) {
     7             if (str.length() != 0) count++;
     8         }
     9         return count;
    10     }
    11 }

     不用API, better solution, O(N) time O(1) space

    1 public int countSegments(String s) {
    2     int res=0;
    3     for(int i=0; i<s.length(); i++)
    4         if(s.charAt(i)!=' ' && (i==0 || s.charAt(i-1)==' '))
    5             res++;        
    6     return res;
    7 }
  • 相关阅读:
    Noip2017 提高组初赛 游(baozha)记
    bzoj4557
    MVVM
    当下较热web前端技术汇总
    JQ 常见demo
    各种宽高
    JQuery 总结
    自定义滚动条配合鼠标滚轮demo
    H5 触摸事件
    SQL必备知识点
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/6139728.html
Copyright © 2011-2022 走看看