Java: Count the two elements of two given arrays of integers with same length, differ by 1 or less

Last update on February 20 2025 11:43:59 (UTC/GMT +8 hours)

Count Elements Differ by 1

Write a Java program to count the elements that differ by 1 or less between two given arrays of integers with the same length.

Pictorial Presentation:

Sample Solution:

Java Code:

import java.util.*;

public class Exercise100 {
    public static void main(String[] args) {
        int[] array_nums1 = {10, 11, 10, 20, 43, 20, 50};
        int[] array_nums2 = {10, 13, 11, 20, 44, 30, 50};
        System.out.println("Array1: "+Arrays.toString(array_nums1)); 
        System.out.println("Array2: "+Arrays.toString(array_nums2)); 
        
        int ctr = 0; // Initialize a counter to keep track of the number of elements

        // Iterate through the arrays to compare elements at the same index
        for (int i = 0; i < array_nums1.length; i++) {
            // Check if the absolute difference between elements is less than or equal to 1
            // and the elements are not equal
            if (Math.abs(array_nums1[i] - array_nums2[i]) <= 1 && array_nums1[i] != array_nums2[i]) {
                ctr++; // If the condition is met, increment the counter
            }
        }
        
        System.out.printf("Number of elements: "+ctr); // Print the number of elements meeting the condition
        System.out.printf("\n");	 
    }
}

Sample Output:

Array1: [10, 11, 10, 20, 43, 20, 50]                                   
Array2: [10, 13, 11, 20, 44, 30, 50]                                   
Number of elements: 2

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to count elements that differ by exactly 2 between two given arrays.
• Write a Java program to count the number of elements in an array that have at least one neighbor differing by 1.
• Write a Java program to count how many elements in an array are one less or one more than their previous element.
• Write a Java program to find the longest subarray where each element differs from the next by exactly 1.

Java Code Editor:

Previous: Write a Java program to check if a specified number appears in every pair of adjacent element of a given array of integers.
Next: Write a Java program to check if the number of 10 is greater than number to 20 in a given array of integers.