mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
27 lines
661 B
JavaScript
27 lines
661 B
JavaScript
/*
|
|
Special Pythagorean triplet
|
|
|
|
A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
|
|
|
|
a^2 + b^2 = c^2
|
|
For example, 32 + 42 = 9 + 16 = 25 = 52.
|
|
|
|
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
|
|
Find the product abc.
|
|
*/
|
|
|
|
const isPythagoreanTriplet = (a, b, c) =>
|
|
Math.pow(a, 2) + Math.pow(b, 2) === Math.pow(c, 2)
|
|
|
|
export const findSpecialPythagoreanTriplet = () => {
|
|
for (let a = 0; a < 1000; a++) {
|
|
for (let b = a + 1; b < 1000; b++) {
|
|
for (let c = b + 1; c < 1000; c++) {
|
|
if (isPythagoreanTriplet(a, b, c) && a + b + c === 1000) {
|
|
return a * b * c
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|