<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
<script>
var obj = []
function getSum(arr) {
var result = 0;
for (let i = 0; i < arr.length; i++) {
//1,2,3,4,5
//遇到数字直接打印
if (typeof arr[i] == 'number') {
result+=(arr[i]);
} else {
//遇到数组就递归
//要循环的数组arr[i]
result += getSum(arr[i]);
}
}
return result;
}
console.log(getSum([1, 2, [3, 4, [5, 6, [7, 8, [9, 10]]]]])); // 55
</script>
</body>
</html>
求递归数组的和
最新推荐文章于 2024-07-15 17:15:41 发布