mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
38 lines
1.2 KiB
HTML
38 lines
1.2 KiB
HTML
<p>Given a string <code>s</code> consisting of some words separated by some number of spaces, return <em>the length of the <strong>last</strong> word in the string.</em></p>
|
|
|
|
<p>A <strong>word</strong> is a maximal substring consisting of non-space characters only.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "Hello World"
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong> The last word is "World" with length 5.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = " fly me to the moon "
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> The last word is "moon" with length 4.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "luffy is still joyboy"
|
|
<strong>Output:</strong> 6
|
|
<strong>Explanation:</strong> The last word is "joyboy" with length 6.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
|
|
<li><code>s</code> consists of only English letters and spaces <code>' '</code>.</li>
|
|
<li>There will be at least one word in <code>s</code>.</li>
|
|
</ul>
|