Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [30 46 16 -46 35 44 18 26 25 -10];
correct = [8 9];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
2 | Pass |
A = [1555 -3288 2061 -4681 -2230 -4538 -4028 3235 1949 -1829];
correct = [3 9];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
3 | Pass |
A = [-1 1 10 -10];
correct = [1 2];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
4 | Pass |
A = [0 1000 -2000 1001 0];
correct = [1 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
5 | Pass |
A = [1:1000 0.5];
correct = [1 1001];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
6 | Pass |
% Area codes
A = [847 217 508 312 212];
correct = [2 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
7 | Pass |
% Zip codes
A = [60048 61802 01702 60601 10001];
correct = [1 4];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
1365 Solvers
Back to basics 11 - Max Integer
678 Solvers
Vectorize the digits of an Integer
269 Solvers
Permute diagonal and antidiagonal
224 Solvers
Find out sum and carry of Binary adder
379 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!