Cody

# Problem 55. Counting Sequence

Solution 562556

Submitted on 22 Jan 2015 by Lukas
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)));

Diff_con = 0 -3 -1 0 0 0 2 num_change = 2 3 7 num_change = 1 3 4 8 y = 0 0 0 0 0 0 0 0 y = 0 5 0 2 0 1 0 3

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

Diff_con = [] num_change = [] num_change = 1 y = 0 0 y = 0 9

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

Diff_con = 0 0 0 0 0 0 0 0 num_change = Empty matrix: 1-by-0 num_change = 1 y = 0 0 y = 0 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)));

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

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

Diff_con = 1 0 -1 num_change = 1 3 num_change = 1 2 4 y = 0 0 0 0 0 0 y = 0 1 0 2 0 1