ruby - 我怎样才能简化或清理这个字谜方法？

Question

我在这里有一个方法，它采用一个字符串数组并将彼此的字谜组合在一起，每个组形成主数组的子anagram_groups数组。

输出很好，但我觉得我的代码可能过于复杂。如果不将事物重构为更多方法，我的逻辑和/或语法怎么能被简化？

def combine_anagrams(words)
  anagram_groups = []
  # For each word in array argument
  words.each do |word|

    # Tracking variable for the word
    word_added = false

    anagram_groups.each do |group|
      # Check if word already exists (prevents duplicates)
      if group.include? word
        word_added = true
      # Add word to group if it is an anagram of the first string in the group
      elsif word.downcase.chars.sort == group[0].downcase.chars.sort
        group << word
        word_added = true        
      end
    end

    # If word was not an anagram of anything, create new group (subarray)
    unless word_added
      anagram_groups << [word]
      word_added = true
    end

  end
  return anagram_groups
end

这是一组用于测试的单词：

test_words = ['cars', 'for', 'potatoes', 'racs', 'four', 'scar', 'creams', 'scream']

Answer 1

test_words.group_by{|w| w.each_char.sort}.values

会给

[
  ["cars", "racs", "scar"],
  ["for"],
  ["potatoes"],
  ["four"],
  ["creams", "scream"]
]

Answer 2

我稍微修改了sawa的答案以忽略大小写并确保没有重复值：

test_words.group_by{|w| w.downcase.each_char.sort}.values.each{|v| v.uniq!}

我意识到如果单词有不同大小写的字符，这仍然会在输出中给出重复项，但这对我的目的来说很好。现在我都整理好了，谢谢！