Cody

# Problem 1985. How unique?

Solution 1220696

Submitted on 26 Jun 2017 by Augusto Mazzei
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 = [2 2 2 3 3 2 3 8 6 5 6]; [U, H] = hunique(A); U_ok = [2 3 8 6 5]; H_ok = [4 3 1 2 1]; assert(isequal(U,U_ok)); assert(isequal(H,H_ok));

U = 2 3 8 6 5 H = 4 H = 4 3 H = 4 3 1 H = 4 3 1 2 H = 4 3 1 2 1

2   Pass
A = [2 2 2 3 3 2 3 8 6 5 6 8]; [U, H] = hunique(A); U_ok = [2 3 8 6 5]; H_ok = [4 3 2 2 1]; assert(isequal(U,U_ok)); assert(isequal(H,H_ok));

U = 2 3 8 6 5 H = 4 H = 4 3 H = 4 3 2 H = 4 3 2 2 H = 4 3 2 2 1

3   Pass
A = 100:-11:1; assert(isequal(hunique(A),A)); [~,H] = hunique(A); assert(isequal(H,ones(1,10)));

U = 100 89 78 67 56 45 34 23 12 1 H = 1 H = 1 1 H = 1 1 1 H = 1 1 1 1 H = 1 1 1 1 1 H = 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 1 U = 100 89 78 67 56 45 34 23 12 1 H = 1 H = 1 1 H = 1 1 1 H = 1 1 1 1 H = 1 1 1 1 1 H = 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 H = 1 1 1 1 1 1 1 1 1 1

4   Pass
A = randi([-10 10],1,100); [U,H] = hunique(A); assert(sum(H)==numel(A)); assert(isequal(unique(A),sort(U))); % number of test cases may increace in the future. % any proposals of test cases warmly welcome.

U = -6 2 -5 3 6 8 -9 -4 9 -1 10 -2 7 5 1 -8 -7 -3 -10 4 H = 6 H = 6 7 H = 6 7 9 H = 6 7 9 7 H = 6 7 9 7 7 H = 6 7 9 7 7 6 H = 6 7 9 7 7 6 7 H = 6 7 9 7 7 6 7 6 H = 6 7 9 7 7 6 7 6 5 H = 6 7 9 7 7 6 7 6 5 2 H = 6 7 9 7 7 6 7 6 5 2 5 H = 6 7 9 7 7 6 7 6 5 2 5 5 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 8 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 8 2 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 8 2 5 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 8 2 5 2 H = 6 7 9 7 7 6 7 6 5 2 5 5 5 2 3 8 2 5 2 1