> For the complete documentation index, see [llms.txt](https://r24zeng.gitbook.io/leetcode-notebook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://r24zeng.gitbook.io/leetcode-notebook/bu-chong-6180-dao/186.-reverse-words-in-a-string-ii.md).

# 186. Reverse Words in a String II

\# Medium

> Given an input string , reverse the string word by word. 
>
> Example:
>
> ```python
> Input:  ["t","h","e"," ","s","k","y"," ","i","s"," ","b","l","u","e"]
> Output: ["b","l","u","e"," ","i","s"," ","s","k","y"," ","t","h","e"]
> ```
>
> Note: 
>
> * A word is defined as a sequence of non-space characters.
> * The input string does not contain leading or trailing spaces.
> * The words are always separated by a single space.
>
> Follow up: Could you do it *in-place* without allocating extra space?

{% hint style="info" %}
Key idea: reverse individual word, then reverse the whole string.
{% endhint %}