2273. Find Resultant Array After Removing Anagrams

Easy
​
You are given a 0-indexed string array words, where words[i] consists of lowercase English letters.
In one operation, select any index i such that 0 < i < words.length and words[i - 1] and words[i] are anagrams, and delete words[i] from words. Keep performing this operation as long as you can select an index that satisfies the conditions.
Return words after performing all operations. It can be shown that selecting the indices for each operation in any arbitrary order will lead to the same result.
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase using all the original letters exactly once. For example, "dacb" is an anagram of "abdc".
Example 1:
Input: words = ["abba","baba","bbaa","cd","cd"]
Output:
["abba","cd"]
Explanation:
One of the ways we can obtain the resultant array is by using the following operations:
- Since words[2] = "bbaa" and words[1] = "baba" are anagrams, we choose index 2 and delete words[2].
Now words = ["abba","baba","cd","cd"].
- Since words[1] = "baba" and words[0] = "abba" are anagrams, we choose index 1 and delete words[1].
Now words = ["abba","cd","cd"].
- Since words[2] = "cd" and words[1] = "cd" are anagrams, we choose index 2 and delete words[2].
Now words = ["abba","cd"].
We can no longer perform any operations, so ["abba","cd"] is the final answer.
Example 2:
Input: words = ["a","b","c","d","e"]
Output:
["a","b","c","d","e"]
Explanation:
No two adjacent strings in words are anagrams of each other, so no operations are performed.
Constraints:
  • 1 <= words.length <= 100
  • 1 <= words[i].length <= 10
  • words[i] consists of lowercase English letters.
​

解題

透過 map 紀錄目前出現的字元個數,之後的詞如果字元個數皆相同,不放進要回傳的答案內;不同的話清空map ,改紀錄新的字串出現的各個字元個數。
Runtime: 4 ms, faster than 81.08%
Memory Usage: 3.5 MB, less than 54.05%
func removeAnagrams(words []string) []string {
ans := make([]string, 0)
m := make(map[[26]byte]bool)
for _, word := range words {
count := [26]byte{}
for _, b := range word {
count[b-97]++
}
if !m[count] {
ans = append(ans, word)
m = make(map[[26]byte]bool)
m[count] = true
}
}
return ans
}