Cody

Problem 576. Return elements unique to either input

Solution 1019679

Submitted on 17 Oct 2016 by Jamil Kasan
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = [1 2 3 4 5]; b = [2 3 4 5 6]; y_correct = [1 6]; assert(isequal(vector_diff(a,b),y_correct))

y = 1 y = 1 6 y = 1 6

2   Pass
a = 10:-2:0; b = 1:2:11; y_correct = 0:11; assert(isequal(vector_diff(a,b),y_correct))

y = 10 y = 10 8 y = 10 8 6 y = 10 8 6 4 y = 10 8 6 4 2 y = 10 8 6 4 2 0 y = 10 8 6 4 2 0 1 y = 10 8 6 4 2 0 1 3 y = 10 8 6 4 2 0 1 3 5 y = 10 8 6 4 2 0 1 3 5 7 y = 10 8 6 4 2 0 1 3 5 7 9 y = 10 8 6 4 2 0 1 3 5 7 9 11 y = 0 1 2 3 4 5 6 7 8 9 10 11

3   Pass
a=magic(5); b=magic(6); y_correct = 26:36; assert(isequal(vector_diff(a,b),y_correct))

y = 35 y = 35 26 y = 35 26 32 y = 35 26 32 31 y = 35 26 32 31 27 y = 35 26 32 31 27 28 y = 35 26 32 31 27 28 33 y = 35 26 32 31 27 28 33 30 y = 35 26 32 31 27 28 33 30 34 y = 35 26 32 31 27 28 33 30 34 36 y = 35 26 32 31 27 28 33 30 34 36 29 y = 26 27 28 29 30 31 32 33 34 35 36

4   Pass
a=(10:100)'; b=11:100; y_correct = 10; assert(isequal(vector_diff(a,b),y_correct))

y = 10 y = 10

5   Pass
a=magic(3)-1.5; b=[]; y_correct = -0.5:7.5; assert(isequal(vector_diff(a,b),y_correct))

y = 6.5000 y = 6.5000 -0.5000 y = 6.5000 -0.5000 4.5000 y = 6.5000 -0.5000 4.5000 1.5000 y = 6.5000 -0.5000 4.5000 1.5000 3.5000 y = 6.5000 -0.5000 4.5000 1.5000 3.5000 5.5000 y = 6.5000 -0.5000 4.5000 1.5000 3.5000 5.5000 2.5000 y = 6.5000 -0.5000 4.5000 1.5000 3.5000 5.5000 2.5000 7.5000 y = 6.5000 -0.5000 4.5000 1.5000 3.5000 5.5000 2.5000 7.5000 0.5000 y = -0.5000 0.5000 1.5000 2.5000 3.5000 4.5000 5.5000 6.5000 7.5000

6   Pass
a=zeros(5); b=ones(3); y_correct=[0 1]; assert(isequal(vector_diff(a,b),y_correct))

y = 0 y = 0 0 y = 0 0 0 y = 0 0 0 0 y = 0 0 0 0 0 y = 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Column 17 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 18 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 19 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 20 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 21 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 22 0 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 23 0 0 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 24 0 0 0 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 25 0 0 0 0 0 0 0 0 0 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 26 0 0 0 0 0 0 0 0 0 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 27 0 0 0 0 0 0 0 0 0 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 28 0 0 0 0 0 0 0 0 0 1 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 29 0 0 0 0 0 0 0 0 0 1 1 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 30 0 0 0 0 0 0 0 0 0 1 1 1 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 31 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 32 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 32 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 Column 33 1 y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 32 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 Columns 33 through 34 1 1 y = 0 1

7   Pass
forbidden = '(regexp)'; assert(isempty(regexp(evalc('type vector_diff'),forbidden)));

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!