Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*Write a function that receives two parameters: sequence of numbers and special bomb number with a certain power.
- Your task is to detonate every occurrence of the special bomb number and according to its power his neighbors from left and right. Detonations are performed from left to right and all detonated numbers disappear.
- */
- //first solution
- function solve(numbers, params) {
- let [target, power]=params;
- for (let i = 0; i < numbers.length; i++) {
- let currentNum = numbers[i];
- if (currentNum===target) {
- let start=Math.max(0, i-power);
- let end=Math.min(i+power, numbers.length-1);
- for (let j = start; j <=end; j++) {
- numbers[j]=0;
- }
- }
- }
- let result = numbers.reduce((a, b)=>a+b, 0)
- console.log(result);
- }
- //second solution
- function solve(numbers, params) {
- let [target, power]=params;
- for (let i = 0; i < numbers.length; i++) {
- let currentNum = numbers[i];
- if (currentNum===target) {
- let start=Math.max(0, i-power);
- let end=Math.min(i+power, numbers.length-1);
- for (let j = start; j <=end; j++) {
- numbers[j]=0;
- }
- }
- }
- let sum=0;
- for (let i = 0; i < numbers.length; i++) {
- sum+=numbers[i];
- }
- console.log(sum);
- }
Advertisement
Add Comment
Please, Sign In to add comment