LeetCode Algorithm 0058 - Length of Last Word (Easy)

版权声明：本文为博主原创文章，未经允许不得转载。 https://blog.csdn.net/darkrabbit/article/details/89735270

LeetCode Algorithm 0058 - Length of Last Word (Easy)

返回分类：全部文章 >> 基础知识

返回上级：LeetCode 算法目录

---

Problem Link: https://leetcode.com/problems/length-of-last-word/

Related Topics: String

---

Description

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.

Example:

Input: "Hello World"
Output: 5

---

Solution C++

// Author: https://blog.csdn.net/DarkRabbit
// Problem: https://leetcode.com/problems/length-of-last-word/
// Difficulty: Easy
// Related Topics: `String`

#pragma once

#include "pch.h"

namespace P58LengthOfLastWord
{
    class Solution
    {
        public:
        int lengthOfLastWord(string s)
        {
            if (s.empty()) // 如果空字符串，直接返回
            {
                return 0;
            }

            int i = s.length() - 1;
            while (s[i] == ' ') // 如果末尾没有字符跳过
            {
                i--;
            }

            int result = 0;
            for (i; i >= 0; i--) // 从末尾向前循环计数
            {
                if (s[i] == ' ')
                {
                    break;
                }
                else
                {
                    result++;
                }
            }

            return result;
        }
    };
}

---