blocks|key|713943|text|我假设X和Y是数组？如果是这样的话，有一种非常简单的方法：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|713944|x+=+[1,+1,+2,+4]
y+=+[1,+2,+2,+2]

#+intersection
x+&+y++++++++++++#+=>+[1,+2]

#+union
x+%7C+y++++++++++++#+=>+[1,+2,+4]

#+difference
x+-+y++++++++++++#+=>+[4]|code-block|syntax|javascript|713945|Source|713946|entityMap|0|LINK|mutability|MUTABLE|url|http://www.techotopia.com/index.php/Advanced_Ruby_Arrays#Intersection.2C_Union_and_Difference^0|3|1|5|1|0|0|0|6|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]|$9|X|A|Y|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|Z|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|10|8|@]|D|@$9|11|A|12|1|13]]|E|$]]|$1|M|3|-4|5|6|7|14|8|@]|D|@]|E|$]]]|N|$O|$5|P|Q|R|E|$S|T]]]]

<p>I assume <code>X</code> and <code>Y</code> are arrays? If so, there's a very simple way to do this:</p>

<pre><code>x = [1, 1, 2, 4]
y = [1, 2, 2, 2]

# intersection
x &amp; y            # =&gt; [1, 2]

# union
x | y            # =&gt; [1, 2, 4]

# difference
x - y            # =&gt; [4]
</code></pre>

<p><a href="http://www.techotopia.com/index.php/Advanced_Ruby_Arrays#Intersection.2C_Union_and_Difference" rel="noreferrer">Source</a></p>


blocks|key|714013|text|利用可以通过&(交集)、-(差集)和%7C(并集)对数组进行集合操作这一事实。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|714014|很明显，我没有实现规范的MultiSet，但这应该可以让您开始：|714015|class+MultiSet
++attr_accessor+:set
++def+initialize(set)
++++@set+=+set
++end
++#+intersection
++def+&(other)
++++@set+&+other.set
++end
++#+difference
++def+-(other)
++++@set+-+other.set
++end
++#+union
++def+%7C(other)
++++@set+%7C+other.set
++end
end

x+=+MultiSet.new([1,1,2,2,3,4,5,6])
y+=+MultiSet.new([1,3,5,6])

p+x+-+y+#+[2,2,4]
p+x+&+y+#+[1,3,5,6]
p+x+%7C+y+#+[1,2,3,4,5,6]|code-block|syntax|javascript|714016|entityMap^0|6|1|C|1|I|1|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@$9|P|A|Q|B|C]|$9|R|A|S|B|C]|$9|T|A|U|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|V|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|W|8|@]|D|@]|E|$K|L]]|$1|M|3|-4|5|6|7|X|8|@]|D|@]|E|$]]]|N|$]]

<p>Utilizing the fact that you can do set operations on arrays by doing <code>&amp;</code>(intersection), <code>-</code>(difference), and <code>|</code>(union).</p>

<p>Obviously I didn't implement the MultiSet to spec, but this should get you started:</p>

<pre><code>class MultiSet
  attr_accessor :set
  def initialize(set)
    @set = set
  end
  # intersection
  def &amp;(other)
    @set &amp; other.set
  end
  # difference
  def -(other)
    @set - other.set
  end
  # union
  def |(other)
    @set | other.set
  end
end

x = MultiSet.new([1,1,2,2,3,4,5,6])
y = MultiSet.new([1,3,5,6])

p x - y # [2,2,4]
p x &amp; y # [1,3,5,6]
p x | y # [1,2,3,4,5,6]
</code></pre>


blocks|key|714100|text|如果Multiset从Array类扩展而来|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|714101|x+=+[1,+1,+2,+4,+7]
y+=+[1,+2,+2,+2]
z+=+[1,+1,+3,+7]|code-block|syntax|javascript|714102|友联市|714103|x.union(y)+++++++++++#+=>+[1,+2,+4,+7]++++++(ONLY+IN+RUBY+2.6)
x.union(y,+z)++++++++#+=>+[1,+2,+4,+7,+3]+++(ONLY+IN+RUBY+2.6)
x+%7C+y++++++++++++++++#+=>+[1,+2,+4,+7]|714104|差异|714105|x.difference(y)++++++#+=>+[4,+7]+(ONLY+IN+RUBY+2.6)
x.difference(y,+z)+++#+=>+[4]+(ONLY+IN+RUBY+2.6)
x+-+y++++++++++++++++#+=>+[4,+7]|714106|交叉点|714107|x.intersection(y)++++#+=>+[1,+2]+(ONLY+IN+RUBY+2.7)
x+&+y++++++++++++++++#+=>+[1,+2]|714108|有关Ruby2.6中新方法的更多信息，可以查看this+blog+post+about+its+new+features|714109|entityMap|0|LINK|mutability|MUTABLE|url|http://anamaria.martinezgomez.name/2018/12/21/ruby2_6.html^0|2|8|B|5|0|0|0|0|0|0|0|0|N|11|0|0^^$0|@$1|2|3|4|5|6|7|16|8|@$9|17|A|18|B|C]|$9|19|A|1A|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|1B|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|1C|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|1D|8|@]|D|@]|E|$I|J]]|$1|O|3|P|5|6|7|1E|8|@]|D|@]|E|$]]|$1|Q|3|R|5|H|7|1F|8|@]|D|@]|E|$I|J]]|$1|S|3|T|5|6|7|1G|8|@]|D|@]|E|$]]|$1|U|3|V|5|H|7|1H|8|@]|D|@]|E|$I|J]]|$1|W|3|X|5|6|7|1I|8|@]|D|@$9|1J|A|1K|1|1L]]|E|$]]|$1|Y|3|-4|5|6|7|1M|8|@]|D|@]|E|$]]]|Z|$10|$5|11|12|13|E|$14|15]]]]

<p>If <code>Multiset</code> extends from the <code>Array</code> class</p>
<pre><code>x = [1, 1, 2, 4, 7]
y = [1, 2, 2, 2]
z = [1, 1, 3, 7]
</code></pre>
<h1>UNION</h1>
<pre><code>x.union(y)           # =&gt; [1, 2, 4, 7]      (ONLY IN RUBY 2.6)
x.union(y, z)        # =&gt; [1, 2, 4, 7, 3]   (ONLY IN RUBY 2.6)
x | y                # =&gt; [1, 2, 4, 7]
</code></pre>
<h1>DIFFERENCE</h1>
<pre><code>x.difference(y)      # =&gt; [4, 7] (ONLY IN RUBY 2.6)
x.difference(y, z)   # =&gt; [4] (ONLY IN RUBY 2.6)
x - y                # =&gt; [4, 7]
</code></pre>
<h1>INTERSECTION</h1>
<pre><code>x.intersection(y)    # =&gt; [1, 2] (ONLY IN RUBY 2.7)
x &amp; y                # =&gt; [1, 2]
</code></pre>
<p>For more info about the new methods in Ruby 2.6, you can check <a href="http://anamaria.martinezgomez.name/2018/12/21/ruby2_6.html" rel="nofollow noreferrer">this blog post about its new features</a></p>


<p>I want to create different methods for a class called <a href="http://en.wikipedia.org/wiki/Multiset">Multiset</a>.</p>

<p>I have all the required methods, but I'm unsure of how to write intersection, union, and subset methods.</p>

<p>For intersection and union, my code starts like this:</p>

<pre><code>def intersect(var)
  x = Multiset.new
end
</code></pre>

<p>Here is an example:</p>

<pre><code>X = [1, 1, 2, 4]
Y = [1, 2, 2, 2]
</code></pre>

<p>then the intersection of <code>X</code> and <code>Y</code> is <code>[1, 2]</code>. </p>


How can I get the intersection, union, and subset of arrays in Ruby?

我想为一个名为的类创建不同的方法。我有所有必需的方法，但我不确定如何编写交集、并集和子集方法。对于交集和并集，我的代码是这样开始的：def intersect(var)  x = Multiset.newend下面是一个示例：X = [1, 1, 2, 4]Y = [1, 2, 2, 2]那么X和Y的交集就是[1, 2...

问如何在Ruby中获得数组的交集、并集和子集？
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在Ruby中获得数组的交集、并集和子集？EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在Ruby中获得数组的交集、并集和子集？
EN