Javascript - 在时间复杂度为 O(n) 且空间复杂度为 O(1) 的给定字符串中删除交替重复字符的最佳方法是什么？

Question

In Javascript, What is the best way to remove alternate repeating character in a given string with time complexity O(n) and Space Complexity was O(1)?

// Example: Input: “you have beautiful eyes” // Output: ”you have btiful es”

Answer 1

You could take a Set and remove visited characters and use a Set for visited characters in a word, then take that character.

you have beautiful eyes    string
-----------------------    ------------------------------
   _    _         _        keep spaces
you have b   tif l    s    filtering with visited
                     e     additional filtering with word
you have b   tif l   es    result

 var string = 'you have beautiful eyes', visited = new Set, word = new Set, result = Array .from(string, c => c === ' ' && (word = new Set) || !visited.has(c) && visited.add(c) || word.has(c) || !word.add(c) ? c : '' ) .join(''); console.log(result);