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

# 151. Reverse Words in a String

Reverse Words in a String

Given an input string, reverse the string word by word.

For example, Given s = "the sky is blue", return "blue is sky the".

Update (2015-02-12): For C programmers: Try to solve it in-place in O(1) space.

click to show clarification.

Clarification:

What constitutes a word? A sequence of non-space characters constitutes a word. Could the input string contain leading or trailing spaces? Yes. However, your reversed string should not contain leading or trailing spaces. How about multiple spaces between two words? Reduce them to a single space in the reversed string.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
    public String reverseWords(String s) {
        if (s == null) return s;

        s = s.trim();
        String[] arr = s.split(" ");

        List<String> result = Arrays.stream(arr).filter(item -> !item.isEmpty()).collect(Collectors.toList());

        StringBuffer sb = new StringBuffer();
        for(int i = result.size()-1; i>=0; i --) {
            String cur = result.get(i);
            char[] chars = cur.toCharArray();

            sb.append(String.valueOf(chars));
            sb.append(" ");
        }

        if (sb.length()-1 <=0) {
            return "";
        } else {
            return sb.substring(0, sb.length() - 1);
        }
    }
}
```