Problème
Compute the Euclidean distance between (x1, y1) and (x2, y2): the square root of (x2 − x1)² + (y2 − y1)².
Implement distance(x1, y1, x2, y2).
Input
x1: First point x. y1: First point y. x2: Second point x. y2: Second point y.
Output
Return the distance.
Contraintes
-1,000,000 ≤ each coordinate ≤ 1,000,000
Exemples
Exemple 1
Entrée :
x1 = 0.0
x2 = 3.0
y1 = 0.0
y2 = 4.0
Sortie attendue :
expected = 5.0Entrée :
double x1 = 0.0;
double x2 = 3.0;
double y1 = 0.0;
double y2 = 4.0;
Sortie attendue :
double expected = 5.0;Entrée :
double x1 = 0.0;
double x2 = 3.0;
double y1 = 0.0;
double y2 = 4.0;
Sortie attendue :
double expected = 5.0;Explication
√(3² + 4²) = √25 = 5.
Exemple 2
Entrée :
x1 = 1.0
x2 = 1.0
y1 = 1.0
y2 = 1.0
Sortie attendue :
expected = 0.0Entrée :
double x1 = 1.0;
double x2 = 1.0;
double y1 = 1.0;
double y2 = 1.0;
Sortie attendue :
double expected = 0.0;Entrée :
double x1 = 1.0;
double x2 = 1.0;
double y1 = 1.0;
double y2 = 1.0;
Sortie attendue :
double expected = 0.0;Explication
Both points are the same, so the distance is 0.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Compute the horizontal and vertical differences between the two points.
Indice 2
Square both differences, add them, then take the square root of the total.
Indice 3
Watch for negative coordinates, but the distance formula still works the same.
Complexité attendue
O(1) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.