Replace every element of the array by its next element
Given an array arr, the task is to replace each element of the array with the element that appears after it and replace the last element with -1.
Examples:
Input: arr[] = {5, 1, 3, 2, 4}
Output: 1 3 2 4 -1
Input: arr[] = {6, 8, 32, 12, 14, 10, 25 }
Output: 8 32 12 14 10 25 -1
Approach: Traverse the array from 0 to n-2 and update arr[i] = arr[i+1]. In the end set a[n-1] = -1 and print the contents of the updated array.
Below is the implementation of the above approach:
C++
// C++ program to replace every element of the array // with the element that appears after it #include <bits/stdc++.h> using namespace std; // Function to print the array after replacing every element // of the array with the element that appears after it void updateArray(int arr[], int n) { // Update array for (int i = 0; i <= n - 2; i++) arr[i] = arr[i + 1]; // Change the last element to -1 arr[n - 1] = -1; // Print the updated array for (int i = 0; i < n; i++) cout << arr[i] << " "; } // Driver program int main() { int arr[] = { 5, 1, 3, 2, 4 }; int N = sizeof(arr) / sizeof(arr[0]); updateArray(arr, N); return 0; } |
chevron_right
filter_none
Java
// Java program to replace every element // of the array with the element that // appears after it class GFG { // Function to print the array after // replacing every element of the array // with the element that appears after it static void updateArray(int arr[], int n) { // Update array for (int i = 0; i <= n - 2; i++) arr[i] = arr[i + 1]; // Change the last element to -1 arr[n - 1] = -1; // Print the updated array for (int i = 0; i < n; i++) System.out.print(arr[i] + " "); } // Driver Code public static void main(String []args) { int arr[] = { 5, 1, 3, 2, 4 } ; int N = arr.length ; updateArray(arr, N); } } // This code is contributed by Ryuga |
chevron_right
filter_none
Python3
# Python3 program to replace every # element of the array with the # element that appears after it # Function to print the array after # replacing every element of the # array with the element that appears # after it def updateArray(arr, n): # Update array for i in range (n - 1): arr[i] = arr[i + 1] # Change the last element to -1 arr[n - 1] = -1 # Print the updated array for i in range( n): print (arr[i], end = " ") # Driver Code if __name__ == "__main__": arr = [ 5, 1, 3, 2, 4 ] N = len(arr) updateArray(arr, N) # This code is contributed # by ChitraNayal |
chevron_right
filter_none
C#
// C# program to replace every element // of the array with the element that // appears after it using System; class GFG { // Function to print the array after // replacing every element of the array // with the element that appears after it static void updateArray(int[] arr, int n) { // Update array for (int i = 0; i <= n - 2; i++) arr[i] = arr[i + 1]; // Change the last element to -1 arr[n - 1] = -1; // Print the updated array for (int i = 0; i < n; i++) Console.Write(arr[i] + " "); } // Driver Code public static void Main() { int[] arr = { 5, 1, 3, 2, 4 } ; int N = arr.Length ; updateArray(arr, N); } } // This code is contributed // by Akanksha Rai |
chevron_right
filter_none
PHP
<?php // PHP program to replace every element // of the array with the element that // appears after it // Function to print the array after // replacing every element of the // array with the element that appears // after it function updateArray(&$arr, $n) { // Update array for ($i = 0; $i <= $n - 2; $i++) $arr[$i] = $arr[$i + 1]; // Change the last element to -1 $arr[$n - 1] = -1; // Print the updated array for ($i = 0; $i < $n; $i++) { echo ($arr[$i]); echo (" "); } } // Driver Code $arr = array(5, 1, 3, 2, 4 ); $N = sizeof($arr); updateArray($arr, $N); // This code is contributed // by Shivi_Aggarwal ?> |
chevron_right
filter_none
Output:
1 3 2 4 -1
Time Complexity : O(n)
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- Replace each element by the difference of the total size of the array and frequency of that element
- Replace every array element by Bitwise Xor of previous and next element
- Replace every element of the array by its previous element
- Replace elements with absolute difference of smallest element on left and largest element on right
- Replace every element with the greatest element on its left side
- Replace every element with the smallest element on its left side
- Replace every array element by sum of previous and next
- Replace every element of the array by sum of all other elements
- Replace every element of the array with BitWise XOR of all other
- Replace every element of the array by product of all other elements
- Replace every array element by multiplication of previous and next
- Replace every element with the greatest element on right side
- Replace the maximum element in the array by coefficient of range
- Largest element smaller than current element on left for every element in Array
- Replace every element with the least greater element on its right
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
