反转空间复杂度为 o(1) 的句子中的单词

Question

I got one question: to reverse the words in a sentence. eg the original string is Mike loves music , after conversion, it should be music loves Mike ;

my approach is simple:

const reverse = (str: string) =>  str.split(' ').reverse().join(' ');

the space complexity is o(n)

However, the follow up question is how to convert it with space complexity o(1) .

I am thinking to use two pointers, but seems too complex. Please advise.

Answer 1

Simply

"yourText".split("").reverse().join("");