728x90
๋ฐ์ํ
๋ฌธ์
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.
์ ๊ทผ๋ฐฉ๋ฒ
๋น ๊ณต๊ฐ๊น์ง ํฌํจํด์ ๋ฐฐ์ด๋ก ๋ณ๊ฒฝ ํ์ ๋ฐฐ์ด์ ๋ฆฌ๋ฒ์ค ํ์ ๋น ์์๊ฐ์ ๋ฒ๋ฆฌ๊ณ ๋จ์ ๊ฒ๋ง ๋ค์ ์คํธ๋ง์ผ๋ก ์ฐ๊ฒฐํ๋ฉด ๋์ง ์์๊น? ํ๋ค.
์ด๋ฐ ๋ฌธ์ ๋ง ์์ผ๋ฉด ์ข๊ฒ ๋ค ..ใ
์ฝ๋
var reverseWords = function(s) {
let wordArr = []
s = s.split(' ').reverse()
s.forEach((w) => {
if(w != ''){
wordArr.push(w)
}
})
return wordArr.join(" ")
};
728x90
'๊ฐ๋ฐ > ๐ฌ ์ฝ๋ฉํ ์คํธ' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[LeetCode/Javascript] 216. Combination Sum III (0) | 2024.02.05 |
---|---|
[leetCode/javascript] 1071. Greatest Common Divisor of Strings (0) | 2024.02.02 |
[leetCode] 746. Min Cost Climbing Stairs - javascript (0) | 2024.01.31 |
[leetCode] 1207. Unique Number of Occurrences / javascript (0) | 2024.01.30 |
[leetCode] 2215. Find the Difference of Two Arrays (1) | 2024.01.30 |