Cody

# Problem 55. Counting Sequence

Solution 719185

Submitted on 21 Aug 2015 by Ian Riley
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)));

count = 1 y = [] num = 5 count = 2 y = 2 5 count = 1 num = 2 y = 2 5 1 2 count = 1 num = 1 count = 2 count = 3 count = 4 y = 2 5 1 2 4 1 count = 1 num = 3 y = 2 5 1 2 4 1 1 3

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

y = 1 9

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

count = 1 y = [] num = 1 count = 2 count = 3 count = 4 count = 5 count = 6 count = 7 count = 8 count = 9 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)));

count = 1 y = [] num = 1 y = 1 1 count = 1 num = 2 y = 1 1 1 2 count = 1 num = 3 y = 1 1 1 2 1 3 count = 1 num = 4 y = 1 1 1 2 1 3 1 4 count = 1 num = 5 y = 1 1 1 2 1 3 1 4 1 5 count = 1 num = 6 y = 1 1 1 2 1 3 1 4 1 5 1 6 count = 1 num = 7 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 count = 1 num = 8 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 count = 1 num = 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)));

count = 1 y = [] num = 1 y = 1 1 count = 1 num = 2 count = 2 y = 1 1 2 2 count = 1 num = 1 y = 1 1 2 2 1 1