【问题标题】:Sorting a struct based on a reference array in ruby根据ruby中的引用数组对结构进行排序
【发布时间】:2021-04-28 18:05:25
【问题描述】:

我有一个结构定义为

Player = Struct.new(:name, :level)

还有一个样本数组

levels = [ 'level-1','level-2','beta','alpha','level4','level7']

我想对结构进行排序,使成员按提到的级别的递增顺序出现 例如

[#<struct Player name="Ryan", level="beta">,
 #<struct Player name="Chris", level="alpha">,
  #<struct Player name="Tom", level="level4">,
 #<struct Player name="Edward", level="level1">,
  #<struct Player name="Drew", level="level7">]

变成

 #[<struct Player name="Edward", level="level1">,
 #<struct Player name="Ryan", level="beta">,
 #<struct Player name="Chris", level="alpha">,
  #<struct Player name="Tom", level="level4">,
  #<struct Player name="Drew", level="level7">]

我如何在 ruby​​ 中做到这一点。

我试过了

arr.sort_by { |e| [ levels.index(e.level)] }

ArgumentError: comparison of Array with Array failed
from (pry):79:in `sort_by'

【问题讨论】:

    标签: arrays ruby


    【解决方案1】:

    你几乎得到它。 sort_by 块的结果应该是您想要比较的结果。您想使用级别索引,而不是包含级别索引的数组。

    arr.sort_by { |e| levels.index(e.level) }
    

    并确保您的关卡字符串正确无误。您可能希望使用常量来避免拼写错误。

    【讨论】:

    • 只想指出,您可以通过预先索引级别数组来优化这里的时间复杂度,例如将其转换为 { &lt;level&gt; =&gt; &lt;index&gt; } 哈希,这样您就不必反复调用 .index
    • 补充@maxpleaner 的建议:对于arr = [["Tom", "level4"], ["Ryan", "beta"], ["Chris", "alpha"]].map { |a| Player.new(*a) } #=&gt; [#&lt;struct Player name="Tom", level="level4"&gt;, #&lt;struct Player name="Ryan", level="beta"&gt;, #&lt;struct Player name="Chris", level="alpha"&gt;],构造level_to_idx = levels.each_with_index.to_a.to_h #=&gt; {"level-1"=&gt;0, "level-2"=&gt;1, "beta"=&gt;2, "alpha"=&gt;3, "level4"=&gt;4, "level7"=&gt;5},...
    • @CarySwoveland 我之前在采访中提出过这个问题,我总是说它会从 O(N^2) 变为 O(N),但我突然想问这是否真的是真的? sort_by的时间复杂度是O(N)吗?
    • ...然后arr.sort_by { |i| level_to_idx[i.level] } #=&gt; [#&lt;struct Player name="Ryan", level="beta"&gt;, #&lt;struct Player name="Chris", level="alpha"&gt;, #&lt;struct Player name="Tom", level="level4"&gt;]。这将计算复杂度从 O(n**2) 降低到 O(nlog(n))。
    • @maxpleaner,你在说什么?我说 O(nlog(n))。 (忏悔:我在删除的评论中说 O(n)。)
    【解决方案2】:

    这是一个计算复杂度接近 O(n) 的解决方案,“接近”,因为哈希查找的时间不是很固定。

    我们得到:

    Player = Struct.new(:name, :level)
    
    arr = [["Tom", "level4"], ["Ryan", "beta"], ["Chris", "alpha"],
           ["Drew", "level4"]].map { |a| Player.new(*a) }
      #=> [#<struct Player name="Tom",   level="level4">,
      #    #<struct Player name="Ryan",  level="beta">,
      #    #<struct Player name="Chris", level="alpha">,
      #    #<struct Player name="Drew",  level="level4">]
    

    请注意,Tom 和 Drew 的级别相同。

    levels = ['level-1','level-2','beta','alpha','level4','level7']
    

    然后

        arr.group_by(&:level).values_at(*levels).flatten.compact
      #=>[#<struct Player name="Ryan",  level="beta">,
      #   #<struct Player name="Chris", level="alpha">,
      #   #<struct Player name="Tom",   level="level4">,
      #   #<struct Player name="Drew",  level="level4">]
    

    步骤如下:

    h = arr.group_by(&:level)
      #=> {"level4"=>[#<struct Player name="Tom",   level="level4">,
      #               #<struct Player name="Drew",  level="level4">],
      #    "beta"  =>[#<struct Player name="Ryan",  level="beta">],
      #    "alpha" =>[#<struct Player name="Chris", level="alpha">]}
    
    a = h.values_at(*levels)
      #=> [nil,
      #    nil,
      #    [#<struct Player name="Ryan",  level="beta">],
      #    [#<struct Player name="Chris", level="alpha">],
      #    [#<struct Player name="Tom",   level="level4">,
      #     #<struct Player name="Drew",  level="level4">],
      #    nil]
    
    b = a.compact
      #=>  [[#<struct Player name="Ryan",  level="beta">],
      #     [#<struct Player name="Chris", level="alpha">],
      #     [#<struct Player name="Tom",   level="level4">,
      #      #<struct Player name="Drew",  level="level4">]]
    
    c = b.flatten
      #=>  [#<struct Player name="Ryan",  level="beta">,
      #     #<struct Player name="Chris", level="alpha">,
      #     #<struct Player name="Tom",   level="level4">,
      #     #<struct Player name="Drew",  level="level4">]
    

    【讨论】:

      猜你喜欢
      • 1970-01-01
      • 2023-03-03
      • 2012-12-01
      • 2016-03-17
      • 1970-01-01
      • 2016-05-12
      • 1970-01-01
      • 1970-01-01
      • 2014-12-02
      相关资源
      最近更新 更多