fork download
  1. import java.util.*;
  2. class BeingZero {
  3. public static boolean isPalindrome(int[] a){
  4. int i=0, j=a.length-1;
  5. while(i<=j){
  6. if(a[i]!=a[j]){
  7. return false;
  8. }
  9. i++;
  10. j--;
  11. }
  12. return true;
  13.  
  14. }
  15. public static void main(String[] args) {
  16. Scanner sc = new Scanner(System.in);
  17. long n = sc.nextLong();
  18. int arr[] = new int[(int)n];
  19. //Reading array elements
  20. for(int i=0;i<n;i++)
  21. {
  22. arr[i]= sc.nextInt();
  23. }
  24. //Print from 0 to n
  25. for(int ele : arr)
  26. {
  27. System.out.print(ele +" ");
  28. }
  29. System.out.println();
  30.  
  31. //Print from n to 0
  32. int N = (int)n;
  33. for(int i = N-1;i>=0;i--)
  34. {
  35. System.out.print(arr[i]+" ");
  36. }
  37. System.out.println();
  38. //Print even index elements
  39. for(int i = 0;i<N;i=i+2) {
  40. System.out.print(arr[i]+" ");
  41. }
  42. System.out.println();
  43. List<Integer> lst=new ArrayList<>();
  44. //sum of this list
  45. for(int x: arr){
  46. lst.add(x);
  47. }
  48. //sum of this list
  49. int sum=0;
  50. for(int i=lst.size()-1;i>=0;i--){
  51. sum+=lst.get(i);
  52. }
  53. boolean f=isPalindrome(arr);
  54. System.out.println(f);
  55.  
  56. }
  57.  
  58. }
Success #stdin #stdout 0.17s 59044KB
stdin
5
1 2 3 2 1
stdout
1 2 3 2 1 
1 2 3 2 1 
1 3 1 
true