Sarrus

codewars js translation of C challenge wip

by trentHarlem

HTML

<p>
W I P
</p>

JavaScript

/////////////////.    W. I. P.
function Sarrus(arr) {
let i=0
arr.reduce((a,c,i,arr) => {
//console.log(arr[0])
//console.log(i,arr[i])
//console.log(arr[i][i])
a*c
//console.log(a[i][i],c[i][i])
//console.log(c[i][i])
//a[i]+c[i][i]
})
}

//.entries()
//console.log(a,c,i)
/* console.log(Sarrus([1]))
console.log(arr)
console.log(arr.flat())
console.log(Sarrus([
  [1, 2],
  [3, 4]
]))
*/
console.log(Sarrus([
  [1, 2, 3],
  [4, 5, 6],
  [7, 8, 9]
]))
 
 console.log(Sarrus([
  [1, 2, 3],
  [4, 5, 6],
  [7, 8, 9],
  [1, 2, 3],
  [4, 5, 6]
]))

/* console.log(Sarrus([
  [1, 2, 3],
  [3, 2, 1],
  [-4, 0, 1]
])) */



const test = [
  [1, 2, 3],
  [4, 5, 6],
  [7, 8, 9]
]
const testComp = [...test,[...test[0]],[...test[1]]]
console.log(testComp)
//console.log(test[0][0])
let testArr= []
let testREV= []
let revArr = test.slice().reverse()
for (let [index,n] of test.entries()) {
console.log(n[index])
testArr.push(n[index])
}
console.log(testArr.reduce((a,c)=>a*c))
for (let [index,n] of revArr.entries()) {
console.log(n[index])
testREV.push(n[index])
}
console.log(testREV.reduce((a,c)=>a*c))
////////////////////////////////////////////////////////
/* 
const myArr = ['foo', 'fighters', 'rule'];
for (const [k,v] of myArr.entries()) {
    console.log(`key = ${k}, value = ${v}`);
} */
// Output:
// key = 0, value = a
// key = 1, value = b
// key = 2, value = c

////////////////////////////////////////////////////////
/* const arr = [];
for (let elem of [0, 1, 2]) {
    arr.push(() => elem);
}
console.log(arr.map(f => f())); // [2, 2, 2]
//var elem
// `elem` exists in the surrounding function:
console.log(arr); // 2
//console.log(elem); // 2
 */