Cody

Solution 2188628

Submitted on 2 Apr 2020 by Simon Hönes
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 = [5 5 2 1 1 1 1 3]; correct = [2 5 1 2 4 1 1 3]; assert(isequal(correct, CountSeq(x)));

countingSequnce = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 countingSequnce = 2 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 countingSequnce = 2 5 0 0 1 2 0 0 0 0 0 0 0 0 0 0 countingSequnce = 2 5 0 0 1 2 4 1 0 0 0 0 0 0 0 0 countingSequnce = 2 5 0 0 1 2 4 1 0 0 0 0 0 0 1 3 y = 2 5 1 2 4 1 1 3

2   Pass
x = [9]; correct = [1 9]; assert(isequal(correct, CountSeq(x)));

countingSequnce = 0 0 countingSequnce = 1 9 y = 1 9

3   Pass
x = ones(1,9); correct = [9 1]; assert(isequal(correct, CountSeq(x)));

countingSequnce = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 countingSequnce = 9 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 9 1

4   Pass
x = 1:9; correct = [1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9]; assert(isequal(correct, CountSeq(x)));

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

5   Pass
x = [1 2 2 1]; correct = [1 1 2 2 1 1]; assert(isequal(correct, CountSeq(x)));

countingSequnce = 0 0 0 0 0 0 0 0 countingSequnce = 1 1 0 0 0 0 0 0 countingSequnce = 1 1 2 2 0 0 0 0 countingSequnce = 1 1 2 2 0 0 1 1 y = 1 1 2 2 1 1