-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdata.js
47 lines (40 loc) · 1 KB
/
data.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
let set1 = [12, 13, 6, 10]
let set2 = [13, 10, 16, 15]
// solution1
// const solve = (set1 , set2) => {
// let newarr =[]
// for(let i = 0; i<set1.length; i++ ){
// let arr1 = set1[i]
// for (let j = 0; j<set2.length; j++){
// let arr2 = set2[j]
// if( arr1 == arr2){
// newarr.push(arr2)
// }
// }
// }
// const sum = newarr.reduce((partialSum, a) => partialSum + a, 0);
// return sum
// }
// solution2
function calc(ans){
let cat = 0
for(var k in ans){
cat += ans[k]
}
return cat
}
function determine( set1 , set2){
let newarr=[]
for(const number of set1){
for(const item of set2){
if(number == item){
newarr.push(item)
}
}
}
return calc(newarr)
}
// soltion1 argument
// console.log(solve([12, 13, 6, 10, 11], [13, 10, 16, 15, 11]))
// solution2 argument
console.log(determine([12, 13, 6, 10, 11], [13, 10, 16, 15, 11]))