LeetCode 151. 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.

• 思路
  最简单且比较容易想到的就是用正则表达式将所有的单词匹配出来，在从尾部遍历，将所有的单词拼接起来。思路简单，代码也很简单。

• 代码（c#）

    public string ReverseWords(string s)
        {
            var arr = System.Text.RegularExpressions.Regex.Matches(s, "\\S+");//匹配所有非空格的字符，即是单词
            StringBuilder sb = new StringBuilder();
            for (int i = arr.Count - 1; i >= 0; i--)
            {
                sb.Append(arr[i].Value + " ");
            }
            return sb.ToString().TrimEnd();
        }

• 相关链接
  LeetCode 原题：https://leetcode.com/problems/reverse-words-in-a-string/description/