Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Replace every element of the array by its next element

  • Last Updated : 05 Aug, 2021

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 
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

 



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;
}
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
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
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
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
?>
Javascript



<script>
 
// Javascript 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 (let 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 (let i = 0; i < n; i++)
        document.write(arr[i] + " ");
}
 
// Driver program
 
    let arr = [ 5, 1, 3, 2, 4 ];
    let N = arr.length;
    updateArray(arr, N);
 
//This code is contributed by Mayank Tyagi
 
</script>
Output: 
1 3 2 4 -1
 
Time Complexity : O(n)
Auxiliary Space: O(1)
 



My Personal Notes
arrow_drop_up
Next

Arrays in Java
Recommended Articles
Page :
Replace every array element by Bitwise Xor of previous and next element
14, Nov 18
Replace every array element by multiplication of previous and next
04, May 15
Replace every array element by sum of previous and next
11, Nov 18
Replace every element in a circular array by sum of next K elements
18, Sep 20
Replace every element of the array by its previous element
05, Dec 18
Replace every element with the greatest element on its left side
15, Nov 18
Replace every element with the smallest element on its left side
15, Nov 18
Replace every element with the least greater element on its right
20, Jul 16
Replace every element of array with sum of elements on its right side
12, Jun 20
Queries to replace every array element by its XOR with a given value with updates
16, Sep 20
Replace every elements in the array by its frequency in the array
10, Nov 18
Replace every vowels with lexicographically next vowel in a String
06, Jul 20
Count of Array elements greater than all elements on its left and next K elements on its right
05, Aug 20
Maximum element in an array such that its previous and next element product is maximum
02, Jul 19
Modify given array by reducing each element by its next smaller element
02, Dec 20
Lexicographically largest array possible from first N natural numbers such that every repetition is present at distance equal to its value from its previous occurrence
15, Feb 21
Minimize replacements to make every element in an array exceed every element in another given array
17, Feb 21
Replace every element with the greatest element on right side
30, Aug 12
Construct array B as last element left of every suffix array obtained by performing given operations on every suffix of given array
20, Jul 21
Replace array elements by sum of next two consecutive elements
25, Mar 19
Find next Smaller of next Greater in an array
10, Dec 16
Replace every element of the array with BitWise XOR of all other
15, Nov 18
Replace every element of the array by sum of all other elements
26, Sep 18
Replace every element of the array by product of all other elements
11, Nov 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
gfg_sal_gfg
@gfg_sal_gfg
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!