본문으둜 κ±΄λ„ˆλ›°κΈ°

πŸ“„ Find Value in Array

1. λ°°μ—΄μ—μ„œ κ³ μœ ν•œ κ°’ 찾기​

I. Set(ES6) μ‚¬μš©β€‹

const array = [6, 4, 3, 2, 4, 1, 6, 3, 2];

const findUniqueValue = (arr) => {
const uniqueValues = new Set(arr);
return [...uniqueValues];
};

console.log(findUniqueValue(array)); // [6, 4, 3, 2, 1]

II. filter μ‚¬μš©β€‹

const array = [6, 4, 3, 2, 4, 1, 6, 3, 2];

const findUniqueValue = (arr) => {
return arr.filter((value, index, self) => self.indexOf(value) === index);
};

console.log(findUniqueValue(array)); // [6, 4, 3, 2, 1]

2. λ°°μ—΄μ—μ„œ ν•œ 번만 λ‚˜νƒ€λ‚˜λŠ” κ°’ 찾기​

I. indexOf와 lastIndexOf 비ꡐ​

const array = [6, 4, 3, 2, 4, 1, 6, 3, 2];

const findSingleValue = (arr) => {
return arr.filter((value) => arr.indexOf(value) === arr.lastIndexOf(value));
};

console.log(findSingleValue(array)); // [1]

II. reduce μ‚¬μš©β€‹

const array = [6, 4, 3, 2, 4, 1, 6, 3, 2, 8, 9];

const findSingleValue = (arr) => {
return arr.reduce((acc, value) => {
if (arr.indexOf(value) === arr.lastIndexOf(value)) {
acc.push(value);
}
return acc;
}, []);
};

console.log(findSingleValue(array)); // [1, 8, 9]

III. Map을 μ‚¬μš©ν•˜μ—¬ μ„±λŠ₯ μ΅œμ ν™”β€‹

ν•œ 번의 순회만으둜 λͺ©μ μ„ 달성

const arr = [6, 4, 3, 2, 4, 1, 6, 3, 2, 7, 8, 9];

const findUniqueValuesOptimized = (arr) => {
const uniqueSet = new Set();
const seenSet = new Set();

for (const num of arr) {
if (!seenSet.has(num)) {
uniqueSet.add(num);
seenSet.add(num);
} else {
uniqueSet.delete(num);
}
}

return Array.from(uniqueSet);
};

console.log(findUniqueValuesOptimized(arr)); // [1, 7, 8, 9]

3. 단일 νƒ€μž… λ°°μ—΄μ˜ 합계 계산​

I for...of λ£¨ν”„λ‘œ λΉ λ₯΄κ²Œ 계산​

const numberArray = [1, 2, 3, 4, 5];

const sumArray = (arr) => {
let sum = 0;
for (const num of arr) {
sum += num;
}
return sum;
};

II. for 루프 μ‚¬μš©β€‹

const numberArray = [1, 2, 3, 4, 5];

const sumArray = (arr) => {
let sum = 0;
for (let i = 0; i < arr.length; i++) {
sum += arr[i];
}
return sum;
};

console.log(sumArray(numberArray)); // 15

4. λ‹€μΈ΅ 쀑첩 λ°°μ—΄μ˜ 합계 계산​

I. μž¬κ·€ μ‚¬μš©β€‹

const nestedArray = [1, 2, [3, 4, [5, 6], 7], 8, [9, 10]];

const sumNestedArray = (arr) => {
return arr.reduce((acc, val) => {
return acc + (Array.isArray(val) ? sumNestedArray(val) : val);
}, 0);
};

console.log(sumNestedArray(nestedArray)); // 55

II. flat으둜 λ°°μ—΄ 평탄화​

배열에 객체가 ν¬ν•¨λœ 경우 flat λ©”μ„œλ“œλ₯Ό μ‚¬μš©ν•  수 μ—†μŠ΅λ‹ˆλ‹€

const nestedArray = [1, 2, [3, 4, [5, 6], 7], 8, [9, 10]];

const sumNestedArray = (arr) => {
return arr.flat(Infinity).reduce((acc, val) => acc + val, 0);
};

console.log(sumNestedArray(nestedArray)); // 55

5. 닀쀑 νƒ€μž… λ°°μ—΄μ—μ„œ 숫자의 합계 계산​

I. reduceλ₯Ό μ‚¬μš©ν•˜μ—¬ 숫자 합계 계산​

const mixedArray = [1, '2', 3, 'four', 5, true, [6], { num: 7 }, '8.5'];

const sumNumbers = (arr) => {
return arr.reduce((sum, item) => {
if (typeof item === 'number') {
return sum + item;
} else if (typeof item === 'string' && !isNaN(Number(item))) {
// λ¬Έμžμ—΄μ„ 숫자둜 λ³€ν™˜ν•΄μ•Ό ν•˜λŠ” 경우 이 처리λ₯Ό μˆ˜ν–‰ν•˜λ©°, λΆˆν•„μš”ν•˜λ©΄ 이 νŒλ‹¨μ„ 제거 κ°€λŠ₯
return sum + Number(item);
}
return sum;
}, 0);
};

console.log(sumNumbers(mixedArray)); // 19.5