This Solution works perfectly on MATLAB. Why not here? Need help
Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
A = [30 46 16 -46 35 44 18 26 25 -10];
correct = [8 9];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
2 | Fail |
A = [1555 -3288 2061 -4681 -2230 -4538 -4028 3235 1949 -1829];
correct = [3 9];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
3 | Fail |
A = [-1 1 10 -10];
correct = [1 2];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
4 | Fail |
A = [0 1000 -2000 1001 0];
correct = [1 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
5 | Fail |
A = [1:1000 0.5];
correct = [1 1001];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
6 | Fail |
% Area codes
A = [847 217 508 312 212];
correct = [2 5];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
7 | Fail |
% Zip codes
A = [60048 61802 01702 60601 10001];
correct = [1 4];
[i1 i2] = nearestNumbers(A);
assert(isequal([i1 i2],correct))
|
2486 Solvers
Project Euler: Problem 9, Pythagorean numbers
282 Solvers
Change the sign of even index entries of the reversed vector
296 Solvers
249 Solvers
445 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!