This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
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))
dist =
16
dist =
14
dist =
5
dist =
4
dist =
2
dist =
1
|
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))
dist =
4843
dist =
506
dist =
394
dist =
112
|
3 | Pass |
A = [-1 1 10 -10];
correct = [1 2];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
dist =
2
|
4 | Pass |
A = [0 1000 -2000 1001 0];
correct = [1 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
dist =
1000
dist =
0
|
5 | Pass |
A = [1:1000 0.5];
correct = [1 1001];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
dist =
1
dist =
0.5000
|
6 | Pass |
% Area codes
A = [847 217 508 312 212];
correct = [2 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
dist =
630
dist =
339
dist =
291
dist =
95
dist =
5
|
7 | Pass |
% Zip codes
A = [60048 61802 01702 60601 10001];
correct = [1 4];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
dist =
1754
dist =
553
|
1529 Solvers
415 Solvers
Vectorize the digits of an Integer
236 Solvers
Create a Multiplication table matrix...
226 Solvers
197 Solvers