Please note, this is a STATIC archive of website www.w3resource.com from 19 Jul 2022, cach3.com does not collect or store any user information, there is no "phishing" involved.
w3resource

Java Exercises: Check if a group of numbers at the start and end of a given array are same

Java Basic: Exercise-105 with Solution

Write a Java program to check if a group of numbers (l) at the start and end of a given array are same.

Pictorial Presentation:

Java Basic Exercises: Check if a group of numbers at the start and end of a given array are same

Sample Solution:

Java Code:

import java.util.*; 
import java.io.*; 
 public class Exercise105 {
 public static void main(String[] args)
 {
	int[] array_nums = {11, 15, 13, 10, 45, 20, 11, 15};
    System.out.println("Original Array: "+Arrays.toString(array_nums)); 
	
	int result = 0;
	int l = 2;
    int start = 0;
	int end = array_nums.length-l;
	for(; l > 0; l--)
	{
		if(array_nums[start] != array_nums[end])
			result = 1;
		else
		{
			start++;
			end++;
		}
	}
	                
    if (result==1)
	 {
	  System.out.printf(String.valueOf(false));
	 }
	else
	 {
	   System.out.printf(String.valueOf(true));
	 }
	 System.out.printf("\n");	
  }
}

Sample Output:

Original Array: [11, 15, 13, 10, 45, 20, 11, 15]                       
true 

Flowchart:

Flowchart: Java exercises: Check if a group of numbers at the start and end of a given array are same

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Java program to create a new array from a given array of integers, new array will contain the elements from the given array before the last element value 10.
Next: Write a Java program to create a new array that is left shifted from a given array of integers.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Java: Tips of the Day

How to sort an ArrayList?

Collections.sort(testList);
Collections.reverse(testList);

That will do what you want. Remember to import Collections though!

Ref: https://bit.ly/32urdSe