前瞻性方法和解决方案代码
似乎发布的问题很适合accumarray -
%// Starting indices of each "group"
start_ind = find(diff([0 ; a(:)]))
%// Setup IDs for each group
id = zeros(1,numel(a)) %// Or id(numel(a))=0 for faster pre-allocation
id(start_ind) = 1
%// Use accumarray to get the products of elements within the same group
out = accumarray(cumsum(id(:)),a(:),[],@prod)
对于非单调递增的输入,需要再添加两行代码-
[~,sorted_idx] = ismember(sort(start_ind),start_ind)
out = out(sorted_idx)
示例运行 -
>> a
a =
2 2 3 5 11 11 17 4 4 1 1 1 7 7
>> out.'
ans =
4 3 5 121 17 16 1 49
扭扭捏捏的
现在,可以使用 logical indexing 删除 find 并使用
更快的预分配方案,为提议的方法提供超级提升,并为我们提供调整后的代码 -
id(numel(a))=0;
id([true ; diff(a(:))~=0])=1;
out = accumarray(cumsum(id(:)),a(:),[],@prod);
基准测试
这是比较迄今为止针对运行时所述问题发布的所有建议方法的基准测试代码 -
%// Setup huge random input array
maxn = 10000;
N = 100000000;
a = sort(randi(maxn,1,N));
%// Warm up tic/toc.
for k = 1:100000
tic(); elapsed = toc();
end
disp('------------------------- With UNIQUE')
tic
ua = unique(a);
out = ua.^histc(a,ua);
toc, clear ua out
disp('------------------------- With ACCUMARRAY')
tic
id(numel(a))=0;
id([true ; diff(a(:))~=0])=1;
out = accumarray(cumsum(id(:)),a(:),[],@prod);
toc, clear out id
disp('------------------------- With FOR-LOOP')
tic
b = a(1);
for k = 2:numel(a)
if a(k)==a(k-1)
b(end) = b(end)*a(k);
else
b(end+1) = a(k);
end
end
toc
运行时
------------------------- With UNIQUE
Elapsed time is 3.050523 seconds.
------------------------- With ACCUMARRAY
Elapsed time is 1.710499 seconds.
------------------------- With FOR-LOOP
Elapsed time is 1.811323 seconds.
结论:看起来,运行时支持accumarray的想法优于其他两种方法!