Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n.
For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1].
If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
Example
For n = 5 and a = [4, 0, 1, -2, 3], the output should be mutateTheArray(n, a) = [4, 5, -1, 2, 1].
b[0] = 0 + a[0] + a[1] = 0 + 4 + 0 = 4
b[1] = a[0] + a[1] + a[2] = 4 + 0 + 1 = 5
b[2] = a[1] + a[2] + a[3] = 0 + 1 + (-2) = -1
b[3] = a[2] + a[3] + a[4] = 1 + (-2) + 3 = 2
b[4] = a[3] + a[4] + 0 = (-2) + 3 + 0 = 1
So, the resulting array after the mutation will be [4, 5, -1, 2, 1].
Input/Output
[execution time limit] 3 seconds (java)
[input] integer n
An integer representing the length of the given array.
Guaranteed constraints:
1 ≤ n ≤ 103.
[input] array. integer a
An array of integers that needs to be mutated.
Guaranteed constraints:
a. length = n,
-103 ≤ a[i] ≤ 103.
[output] array. integer
The resulting array after the mutation.

The program written in Java is as follows

import java.util.Scanner;

public class mutilate {

public static void main(String [] args) {

Scanner input = new Scanner(System.in);

int n;

System.out.print("Array Length: ");

n = input.nextInt();

while(n<1 || n > 103)  {

    System.out.print("Array Length: ");

n = input.nextInt();

}

int a []= new int [n];

int b []= new int [n];

System.out.print("Enter Elements of the Array: ");

for(int i =0;i<n;i++)  {

 a[i] = input.nextInt();

}

System.out.print("Output: ");

for(int i =0;i<n;i++)  {

 if(i == 0)  {

     b[i] = 0+a[i]+a[i+1];

 }

 else if(i == n-1)  {

     b[i] = a[i - 1]+a[i]+0;

 }

 else  {

 b[i] = a[i - 1]+a[i]+a[i+1];    

 }

 System.out.print(b[i]+" ");

}

}

}

Explanation:

This line allows the program accepts user input

Scanner input = new Scanner(System.in);

This line declares integer n

int n;

The next two line prompts user for length of the array and also accepts input

System.out.print("Array Length: ");

n = input.nextInt();

The following while iteration ensures that the user input is between 1 and 103

while(n<1 || n > 103)  {

    System.out.print("Array Length: ");

n = input.nextInt();

}

The next two lines declares array a and b

int a []= new int [n];

int b []= new int [n];

The next for iteration allows user enter values for array a

System.out.print("Enter Elements of the Array: ");

for(int i =0;i<n;i++)  {

 a[i] = input.nextInt();

}

The next for iteration calculates and prints the values for array b based on the instruction in the question

System.out.print("Output: ");

for(int i =0;i<n;i++)  {

 if(i == 0)  {

     b[i] = 0+a[i]+a[i+1];

 }

 else if(i == n-1)  {

     b[i] = a[i - 1]+a[i]+0;

 }

 else  {

 b[i] = a[i - 1]+a[i]+a[i+1];    

 }

 System.out.print(b[i]+" ");

}

the only way i would see could be an autoclicker type software. but that is very time consuming.

b. related objects

explanation:

data is stored in related objects in an access database.