> For the complete documentation index, see [llms.txt](https://stanley7342.gitbook.io/programming/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://stanley7342.gitbook.io/programming/leetcode/58.-length-of-last-word.md).

# 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.

**Example:**

```
Input: "Hello World"
Output: 5
```

## **解題思路**

{% hint style="info" %}

1. 利用std::[istringstream](http://www.cplusplus.com/reference/sstream/istringstream/)::str來拆解字串。
   {% endhint %}

## 程式解答

```cpp
class Solution 
{
public:
    int lengthOfLastWord(string s) 
    {
        std::vector<std::string> result;
        std::istringstream iss(s);
        for (std::string s; iss >> s; )
            result.push_back(s);
        if (!result.size())
            return 0;
        return result[result.size() - 1].length();
    }
};
```