Open qappleh opened 3 years ago
var reverseWords = function(s) {
return s.trim().replace(/\s+/g, ' ').split(' ').reverse().join(' ')
};
双端队列,故名思义就是两端都可以进队的队列
解题思路:
画图理解:
代码实现:
var reverseWords = function(s) {
let left = 0
let right = s.length - 1
let queue = []
let word = ''
while (s.charAt(left) === ' ') left ++
while (s.charAt(right) === ' ') right --
while (left <= right) {
let char = s.charAt(left)
if (char === ' ' && word) {
queue.unshift(word)
word = ''
} else if (char !== ' '){
word += char
}
left++
}
queue.unshift(word)
return queue.join(' ')
};
给定一个字符串,逐个翻转字符串中的每个单词。
示例 1:
示例 2:
示例 3:
说明: