algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-20 10:37:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

Removed mistakenly added semicolon

Browse Source
This commit is contained in:
Omkarnath Parida
2021-10-02 23:55:41 +05:30
parent 8b1d10df78
commit b38a94dda5
2 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
Project-Euler/Problem8.js
View File

@ -1,26 +1,26 @@
// Problem: https://projecteuler.net/problem=8
const largestAdjacentNumber = (grid, consecutive) => {
grid = grid.split('\n').join('');
const splitedGrid = grid.split("\n");
let largestProd = 0;
grid = grid.split('\n').join('')
const splitedGrid = grid.split('\n')
let largestProd = 0
for (let row in splitedGrid) {
const currentRow = splitedGrid[row].split('').map(x => Number(x));
for (const row in splitedGrid) {
const currentRow = splitedGrid[row].split('').map(x => Number(x))
for (let i = 0; i < currentRow.length - consecutive; i++) {
const combine = currentRow.slice(i, i + consecutive);
const combine = currentRow.slice(i, i + consecutive)
if (!combine.includes(0)) {
const product = combine.reduce(function (a, b) {
return a * b
});
})
if (largestProd < product) largestProd = product;
if (largestProd < product) largestProd = product
}
}
}
return largestProd;
return largestProd
}
export { largestAdjacentNumber };
export { largestAdjacentNumber }