Cody

Problem 51. Find the two most distant points

Solution 2948683

Submitted on 15 Sep 2020 by 泽丰 张
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
p = [0 0; 1 0; 2 2; 0 1]; ix_correct = [1 3]; assert(isequal(mostDistant(p),ix_correct))

d = -1 0 d = -2 -2 d = 0 -1 d = -1 -2 d = 1 -1 d = 2 1

2   Pass
p = [0 0; 1 0; 2 2; 0 10]; ix_correct = [2 4]; assert(isequal(mostDistant(p),ix_correct))

d = -1 0 d = -2 -2 d = 0 -10 d = -1 -2 d = 1 -10 d = 2 -8

3   Pass
p = [0 0; -1 50]; ix_correct = [1 2]; assert(isequal(mostDistant(p),ix_correct))

d = 1 -50

4   Pass
p = [5 5; 1 0; 2 2; 0 10; -100 20; 1000 400]; ix_correct = [5 6]; assert(isequal(mostDistant(p),ix_correct))

d = 4 5 d = 3 3 d = 5 -5 d = 105 -15 d = -995 -395 d = -1 -2 d = 1 -10 d = 101 -20 d = -999 -400 d = 2 -8 d = 102 -18 d = -998 -398 d = 100 -10 d = -1000 -390 d = -1100 -380

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!