ast*_*nic 18 ruby arrays performance
我需要一种非常快速的方法来确定数组是否仅包含值为的整数9.这是我目前的解决方案:
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.uniq == [9]
Run Code Online (Sandbox Code Playgroud)
你能更快地完成吗?
Vas*_*ich 31
require 'benchmark'
n = 50000
Benchmark.bm do |x|
x.report "uniq " do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.uniq == [9]
end
end
x.report "delete" do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.delete 9
input == []
end
end
x.report "count " do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.count(9)==input.size
end
end
x.report "select" do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.select{|x| x != 9}.empty?
end
end
x.report "detect" do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.detect { |i| i != 9 }.nil?
end
end
x.report "all? " do
n.times do
input = [9,9,9,9,9,9,9,9,9,9,9,9]
input.all?{|x| x == 9}
end
end
end
Run Code Online (Sandbox Code Playgroud)
它是上述答案和一些我的答案的基准
user system total real
uniq 0.313000 0.000000 0.313000 ( 0.312500)
delete 0.140000 0.000000 0.140000 ( 0.140625)
count 0.079000 0.000000 0.079000 ( 0.078125)
select 0.234000 0.000000 0.234000 ( 0.234375)
detect 0.234000 0.000000 0.234000 ( 0.234375)
all? 0.219000 0.000000 0.219000 ( 0.218750)
Run Code Online (Sandbox Code Playgroud)
如果input = [1]+[9]*9:
user system total real
uniq 0.328000 0.000000 0.328000 ( 0.328125)
delete 0.188000 0.000000 0.188000 ( 0.203125)
count 0.187000 0.000000 0.187000 ( 0.218750)
select 0.281000 0.016000 0.297000 ( 0.296875)
detect 0.203000 0.000000 0.203000 ( 0.203125)
all? 0.204000 0.000000 0.204000 ( 0.203125)
Run Code Online (Sandbox Code Playgroud)
如果input = [9]*9 + [1]:
user system total real
uniq 0.313000 0.000000 0.313000 ( 0.328125)
delete 0.187000 0.000000 0.187000 ( 0.187500)
count 0.172000 0.000000 0.172000 ( 0.187500)
select 0.297000 0.000000 0.297000 ( 0.312500)
detect 0.313000 0.000000 0.313000 ( 0.312500)
all? 0.281000 0.000000 0.281000 ( 0.281250)
Run Code Online (Sandbox Code Playgroud)
如果input = [1,2,3,4,5,6,7,8,9]:
user system total real
uniq 0.407000 0.000000 0.407000 ( 0.406250)
delete 0.125000 0.000000 0.125000 ( 0.125000)
count 0.125000 0.000000 0.125000 ( 0.125000)
select 0.218000 0.000000 0.218000 ( 0.234375)
detect 0.110000 0.000000 0.110000 ( 0.109375)
all? 0.109000 0.000000 0.109000 ( 0.109375)
Run Code Online (Sandbox Code Playgroud)
yan*_*yan 16
你有几个选择:
>> input.count(9)==input.size
=> true
Run Code Online (Sandbox Code Playgroud)
要么
>> input.select{|x| x != 9}.empty?
=> true
Run Code Online (Sandbox Code Playgroud)
或者你上面的解决方案.
| 归档时间: |
|
| 查看次数: |
10192 次 |
| 最近记录: |