zoukankan      html  css  js  c++  java
  • leetcode 58

    58. Length of Last Word

    Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

    If the last word does not exist, return 0.

    Note: A word is defined as a character sequence consists of non-space characters only.

    For example, 
    Given s = "Hello World",
    return 5.

    这道题比较简单,注意考虑字符串最后的空格以及全为空格的字符串的这几种特殊情况。

    代码如下:

     1 class Solution {
     2 public:
     3     int lengthOfLastWord(string s) {
     4         if(s.length() == 0)
     5         {
     6             return 0;
     7         }
     8         int n = 0;
     9         int l = s.length();
    10         for(int i = l-1; i >= 0; i--)
    11         {
    12             if(n == 0 && s[i] == ' ')
    13             {
    14                 continue;
    15             }
    16             if(s[i] != ' ')
    17             {
    18                 n ++;
    19             }
    20             else
    21             {
    22                 break;
    23             }
    24         }
    25         return n;
    26     }
    27 };
  • 相关阅读:
    leetcode hot 100
    tls证书制作
    全面解析Kafka
    redis cluster
    redis 常用命令
    mysql 备份
    mysql 读写分离
    mysql 复制模式
    mysql 主从
    mysql多实例以及主从
  • 原文地址:https://www.cnblogs.com/shellfishsplace/p/5855874.html
Copyright © 2011-2022 走看看