Условие
Cosine similarity compares the direction of two vectors and ignores their length. Semantic search uses it to find texts with similar embeddings:
cos(a, b) = (a · b) / (|a| × |b|), where |a| = √(a₁² + a₂² + … + aₙ²)
The result is 1 for the same direction, 0 for perpendicular vectors and -1 for opposite directions. If either vector is all zeros, return 0.
Implement cosine_similarity(a, b).
Input
a, b: Two lists of numbers with the same length.
Output
Return the cosine similarity as a decimal number.
Ограничения
1 ≤ length ≤ 1,000
-1,000 ≤ each value ≤ 1,000
Примеры
Ввод:
a = [1.0, 0.0]
b = [0.0, 1.0]
Ожидаемый вывод:
expected = 0.0
Ввод:
std::vector<double> a = {1.0, 0.0};
std::vector<double> b = {0.0, 1.0};
Ожидаемый вывод:
double expected = 0.0;
Ввод:
double[] a = new double[] {1.0, 0.0};
double[] b = new double[] {0.0, 1.0};
Ожидаемый вывод:
double expected = 0.0;
Пояснение
The dot product is 0, so the vectors are perpendicular and the similarity is 0.
Ввод:
a = [1.0, 2.0, 3.0]
b = [2.0, 4.0, 6.0]
Ожидаемый вывод:
expected = 1.0
Ввод:
std::vector<double> a = {1.0, 2.0, 3.0};
std::vector<double> b = {2.0, 4.0, 6.0};
Ожидаемый вывод:
double expected = 1.0;
Ввод:
double[] a = new double[] {1.0, 2.0, 3.0};
double[] b = new double[] {2.0, 4.0, 6.0};
Ожидаемый вывод:
double expected = 1.0;
Пояснение
b is a times 2: same direction, so the similarity is 1 even though the lengths differ.
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
The score depends on direction, so first compute the dot product and both vector lengths separately.
Подсказка 2
If either vector has zero magnitude, the similarity is defined as zero instead of dividing by zero.
Подсказка 3
Use the same index across both vectors for every term, and remember the denominator is the product of magnitudes.
Ожидаемая сложность
O(n) time, O(1) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.