Hackerrank Data Strcture Arrays - Left rotation solution in Java

Solution:
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

   
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int d = in.nextInt();
        int i,j,temp;
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        
        for( i=0;i<d;i++)
        {
            temp=a[0];
            for(j=0;j<n-1;j++)
            {            
                a[j]=a[j+1];
            }
             a[j]=temp;
        }
      
        for( i=0;i<n;i++)
        {         
         System.out.print(a[i] + " ");          
        }
        in.close();
    }
}