๐ 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