151. Reverse Words in a String

Given an input string s, reverse the order of the words.

A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.

Return a string of the words in reverse order concatenated by a single space.

Note that s 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.

Example 1:

Input: s = "the sky is blue"
Output: "blue is sky the"
Example 2:

Input: s = " hello world "
Output: "world hello"
Explanation: Your reversed string should not contain leading or trailing spaces.
Example 3:

Input: s = "a good example"
Output: "example good a"
Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.

투 포인터를 써서 하는 법:

class Solution:
    def reverseWords(self, s: str) -> str:
        words = s.split()
        left, right = 0, len(words) - 1

        while left < right:
            words[left], words[right] = words[right], words[left]
            left += 1
            right -= 1

        return " ".join(words) 

파이썬(또는 자바)에서 먹히는 방법

class Solution:
    def reverseWords(self, s: str) -> str:
        return " ".join(reversed(s.split()))

처음엔 정규표현식 써야하나 싶어서 뭔가 좀 막막했는데 하 저 split()이랑 reversed()가 생각이 안 나서 못 풀었음..으아 평소에 코딩을 하자.