此函式回傳陣列中所有元素的總和
const array = [4, 7, 24, 7, 0, 10];
const number = 7;
//const isInArray = array.includes(number);
function addTheSameNumbers1(number, array) {
let count = array.length;
for (let i=0; i<count; i ) {
if (array[i] === number) {return array.reduce((a,b) => a b, 0);}
}
return null;
}
console.log(addTheSameNumbers1(number, array));```
uj5u.com熱心網友回復:
你reduce()正在總結所有的價值。這是對單個數字求和的方法:
const array = [4, 7, 24, 7, 0, 10];
const number = 7;
function addTheSameNumbers1(number, array) {
return array.reduce((accum, val) =>
val === number ? accum val : accum
, 0);
}
const result = addTheSameNumbers1(number, array);
console.log(result);
uj5u.com熱心網友回復:
如果我理解正確的話,您希望獲得具有與其父陣列長度相同的值的元素的總和。這段代碼應該可以。
const sumElemsWhichAreEqualToGivenArrayLength = (numbers) => {
const len = numbers.length;
return numbers
.filter((n) => n === len)
.reduce((n, total) => total n, 0);
};
首先,它過濾不等于父陣列長度的元素,然后獲取剩余元素的總和。請注意,此處未實施驗證,但我相信您可以輕松做到這一點。
uj5u.com熱心網友回復:
你可以得到變數的出現次數和數字的倍數
<script>
const countOccurrences = (arr, val) => arr.reduce((a, v) => (v === val ? a 1 : a), 0);
const array = [4, 7, 24, 7, 0, 10];
const number = 7;
var accur = countOccurrences(array, number);
console.log(accur);
console.log(accur * number);
</script>
uj5u.com熱心網友回復:
另一種方法reduce是使用簡單的for/of回圈迭代數字,然后將任何找到的數字添加到sum變數中。
const array = [4, 7, 24, 7, 0, 10];
const number = 7;
function sumTheSameNumber(n, arr) {
let sum = 0;
for (let i of arr) {
if (i === n) sum = i;
}
return sum;
}
console.log(sumTheSameNumber(number, array));
轉載請註明出處,本文鏈接:https://www.uj5u.com/qita/336663.html
標籤:javascript 数组
上一篇:使用條件步驟創建numpy陣列
下一篇:Pangram檢測
