我推迟发布我的解决方案,因为我正确地怀疑这道题是作业。然而,既然OP已经接受了乔纳斯的回答,我不妨发布我的。
Code
的组合sum
, length
, any
, and min
诀窍是:
function out = stupidTutor(a, b)
a = sum(a, 1); % if a is empty, replace it by a 1-by-0 matrix
specials = a(a == 1:length(a)); % construct the vector of special numbers
b = sum(b, 1); % if b is empty, replace it by a 1-by-0 matrix
% some dyadic-product shenanigans
A = specials' * (b == b);
B = (specials == specials)' * b;
ind = any(A == B, 1);
temp = min(b(ind)); % temp is either a scalar, a 1-by-0 matrix, or []
out = sum(sum(temp, 2), 1); % trick to return 0 in case temp be 1-by-0 or []
Tests
% a b result
stupidTutor([9 9 3 9] , [3 4 5]) % 3
stupidTutor([9 9 3 9] , [9 8]) % 0
stupidTutor([9 9 9 9 5], [3 4 5 3]) % 5
stupidTutor([9 9 3 9 5], [3 4 5 3]) % 3
stupidTutor([9 9 3 9 5], [5 4 3 2 1]) % 3
stupidTutor([9 9 3 9] , []) % 0
stupidTutor([] , [3 4 5]) % 0
stupidTutor([] , []) % 0