Question

Write a function replaceNums that replaces each element except the first and last by the larger of its two neighbors. Your function should take two parameters, an integer array and the array length (in this order). Your function should not return or print anything. Examples int myArray[2] = {1, 5); → {1.9 int myArray 1 3(1); → {1} int myArray[3] = {1, 3, 5); → {1, 5.9 int myArray[3] = {5, 3, 1); → {5, 5, 1} int myArray[5] = {1, 2, 3, 4, 5); → {1, 3, 4, 5, 5} int myArray[5] = {5, 4, 3, 2, 1); → {5, 5, 4, 3, 1} Note: as you attempt to replace elements of the array, keep in mind that once an element's value is overwritten, you won't be able to have access to the old value. Think of a way to "remember" the original values in the array. Good luck!

Answer 1

#include<iostream>

using namespace std;

int main()

{

int n;

cout<<"Enter size of Array : ";

cin>>n;

int arr[n];

int res[n];

cout<<"Enter Array Elements : ";

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

cin>>arr[i];

res[0]=arr[0];

res[n-1]=arr[n-1];

for(int i=1;i<n-1;i++)

{

if(arr[i-1]>arr[i+1])

res[i]=arr[i-1];

else

res[i]=arr[i+1];

}

cout<<"Output Array"<<endl;

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

cout<<res[i]<<" ";

}