-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
ac9e96c
commit ae2e2b8
Showing
1 changed file
with
41 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,41 @@ | ||
| <h2><a href="https://leetcode.com/problems/reverse-words-in-a-string/">151. Reverse Words in a String</a></h2><h3>Medium</h3><hr><div><p>Given an input string <code>s</code>, reverse the order of the <strong>words</strong>.</p> | ||
|
|
||
| <p>A <strong>word</strong> is defined as a sequence of non-space characters. The <strong>words</strong> in <code>s</code> will be separated by at least one space.</p> | ||
|
|
||
| <p>Return <em>a string of the words in reverse order concatenated by a single space.</em></p> | ||
|
|
||
| <p><b>Note</b> that <code>s</code> may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.</p> | ||
|
|
||
| <p> </p> | ||
| <p><strong class="example">Example 1:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> s = "the sky is blue" | ||
| <strong>Output:</strong> "blue is sky the" | ||
| </pre> | ||
|
|
||
| <p><strong class="example">Example 2:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> s = " hello world " | ||
| <strong>Output:</strong> "world hello" | ||
| <strong>Explanation:</strong> Your reversed string should not contain leading or trailing spaces. | ||
| </pre> | ||
|
|
||
| <p><strong class="example">Example 3:</strong></p> | ||
|
|
||
| <pre><strong>Input:</strong> s = "a good example" | ||
| <strong>Output:</strong> "example good a" | ||
| <strong>Explanation:</strong> You need to reduce multiple spaces between two words to a single space in the reversed string. | ||
| </pre> | ||
|
|
||
| <p> </p> | ||
| <p><strong>Constraints:</strong></p> | ||
|
|
||
| <ul> | ||
| <li><code>1 <= s.length <= 10<sup>4</sup></code></li> | ||
| <li><code>s</code> contains English letters (upper-case and lower-case), digits, and spaces <code>' '</code>.</li> | ||
| <li>There is <strong>at least one</strong> word in <code>s</code>.</li> | ||
| </ul> | ||
|
|
||
| <p> </p> | ||
| <p><b data-stringify-type="bold">Follow-up: </b>If the string data type is mutable in your language, can you solve it <b data-stringify-type="bold">in-place</b> with <code data-stringify-type="code">O(1)</code> extra space?</p> | ||
| </div> |