This solution is outdated. To rescore this solution, sign in.
function y = common_by_row(x)
y=[];
[r,c]=size(x);
if r>0
a=x(1,:);
cnt=zeros(1,c);
for j=1:c
for i=1:r
if isempty(find(x(i,:)==x(1,j)))==0
cnt(j)=cnt(j)+1;
end
end
end
for j=1:c
if cnt(j)==r&&x(1,j)~=NaN&&ismember(x(1,j),y)==0
y=[y x(1,j)];
end
end
y=sort(y);
end
end
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
2 | Pass |
x = [1e100; 1e100];
y_correct = [1e100];
assert(isequal(common_by_row(x),y_correct))
|
3 | Pass |
x = [1; 2];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
4 | Pass |
x = ones(10);
y_correct = [1];
assert(isequal(common_by_row(x),y_correct))
|
5 | Pass |
x = magic(10);
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
6 | Pass |
x = wilkinson(9);
y_correct = [0 1];
assert(isequal(common_by_row(x),y_correct))
|
7 | Pass |
x = [3 -2 1 NaN; NaN 0 -2 3];
y_correct = [-2 3];
assert(isequal(common_by_row(x),y_correct))
|
405 Solvers
Sum all integers from 1 to 2^n
8414 Solvers
267 Solvers
338 Solvers
2770 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!