mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +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>
37 lines
1.0 KiB
JavaScript
37 lines
1.0 KiB
JavaScript
/**
|
|
* @author mrmagic2020
|
|
* @description The function will find the parity outlier from an array of integers.
|
|
* @see https://en.wikipedia.org/wiki/Parity_(mathematics)
|
|
* @param {number[]} integers - An array of integers.
|
|
* @returns {number} - The parity outlier.
|
|
* @example parityOutlier([1, 3, 5, 8, 9]) = 8
|
|
*/
|
|
const parityOutlier = (integers) => {
|
|
let oddsCount = 0 // define counter for odd number(s)
|
|
let evensCount = 0 // define counter for even number(s)
|
|
let odd, even
|
|
|
|
for (const e of integers) {
|
|
if (!Number.isInteger(e)) {
|
|
// detect non-integer elements
|
|
return null
|
|
}
|
|
if (e % 2 === 0) {
|
|
// an even number
|
|
even = e
|
|
evensCount++
|
|
} else {
|
|
// an odd number
|
|
odd = e
|
|
oddsCount++
|
|
}
|
|
}
|
|
|
|
if (oddsCount === 0 || evensCount === 0) return null // array has only odd/even number(s)
|
|
if (oddsCount > 1 && evensCount > 1) return null // array has more than one even and odd number
|
|
|
|
return oddsCount === 1 ? odd : even
|
|
}
|
|
|
|
export { parityOutlier }
|