Your Friendly Array Neighbor Program only in java not in python Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n: -If an element is smaller than both left and right neighbor, then this element is incremented -If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented. -The first and last elements should never change Eventually after some days the array will not change, some examples: Example: Input from user: ar = [6,2,3,4] Output from program: [6,3,3,4] After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed. Example: Input from user: ar = [1,6,3,4,3,5] Output from program: [1,4,4,4,4,5] After the first day the array is changed from [1,6,3,4,3,5] to [1,5,4,3,4,5]. After the second day the array is changed from [1,5,4,3,4,5] to [1,4,4,4,4,5] and no further operations may be completed.
Your Friendly Array Neighbor
Program only in java not in python
Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:
-If an element is smaller than both left and right neighbor, then this element is incremented
-If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented.
-The first and last elements should never change
Eventually after some days the array will not change, some examples:
Example:
Input from user: ar = [6,2,3,4]
Output from program: [6,3,3,4]
After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.
Example:
Input from user: ar = [1,6,3,4,3,5]
Output from program: [1,4,4,4,4,5]
After the first day the array is changed from [1,6,3,4,3,5] to [1,5,4,3,4,5].
After the second day the array is changed from [1,5,4,3,4,5] to [1,4,4,4,4,5] and no further operations may be completed.

Step by step
Solved in 2 steps with 3 images









