Question

How to check if product of every adjacent pairs exists in an array with Java

Answer 1

import java.util.HashSet;
import java.util.Arrays;

public class MyClass {
    private static boolean check_product_of_every_pair(final Integer[] array) {
    	HashSet<Integer> set = new HashSet<Integer>(Arrays.asList(array));
    
    	for (int i = 0; i < array.length; i += 2) {
    		int product = array[i] * array[i + 1];
    		System.out.println(array[i] + " * " + array[i + 1] + " = " + product);
    		
    		if (! set.contains(product)) {
    			return false;
    		}
    	}
    
    	return true;
    }

    public static void main(String args[]) {
      	Integer[] array = {2, 3, 6, 5, 30, 0};

	    System.out.print((check_product_of_every_pair(array) ? "Yes" : "No"));
    }
}






/*
run:
 
2 * 3 = 6
6 * 5 = 30
30 * 0 = 0
Yes
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

import java.util.Arrays;
 
public class MyClass {
    private static boolean check_product_of_every_pair(final Integer[] array) {
        for (int i = 0; i < array.length; i += 2) {
            int product = array[i] * array[i + 1];
            System.out.println(array[i] + " * " + array[i + 1] + " = " + product);
             
            if (! Arrays.asList(array).contains(product)) {
                return false;
            }
        }
     
        return true;
    }
 
    public static void main(String args[]) {
        Integer[] array = {2, 3, 6, 5, 30, 0};
 
        System.out.print((check_product_of_every_pair(array) ? "Yes" : "No"));
    }
}


 
 
 
/*
run:
  
2 * 3 = 6
6 * 5 = 30
30 * 0 = 0
Yes
  
*/

 

70+ SQL courses for beginners and professionals