Cody

# Problem 2012. Tony's trick for duplicating an mx1 vector n times

Solution 2068638

Submitted on 24 Dec 2019 by Martin C.
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
x=magic(3); n=3; y_correct=[8 8 8; 3 3 3; 4 4 4]; assert(isequal(reproduce_nv(x,n),y_correct))

v1 = 8 8 8 3 3 3 4 4 4

2   Pass
x=magic(10); n=19; y_correct=repmat(x(:,1),1,19); assert(isequal(reproduce_nv(x,n),y_correct))

v1 = 92 92 92 92 92 92 92 92 92 92 92 92 92 92 92 92 92 92 92 98 98 98 98 98 98 98 98 98 98 98 98 98 98 98 98 98 98 98 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 79 79 79 79 79 79 79 79 79 79 79 79 79 79 79 79 79 79 79 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11

3   Pass
x=1; n=0; y_correct=linspace(x,x,n); %arbitrary way to get the soln assert(isequal(reproduce_nv(x,n),y_correct))

v1 = 1×0 empty double row vector

4   Pass
x='1'; n=7; y_correct=['1' '1' '1' '1' '1' '1' '1']; assert(isequal(reproduce_nv(x,n),y_correct))

v1 = 49 49 49 49 49 49 49

### Community Treasure Hunt

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

Start Hunting!