HackerRank Java Between Two Sets
문제링크 : https://www.hackerrank.com/challenges/between-two-sets/problem You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: The elements of the first array are all factors of the integer being considered The integer being considered is a factor of all elements of the second array These numbers are referred to as being between the two arrays. You must determine how many such numbers exist. For example, given the arrays and , there are two numbers between them: and . , , and for the first value. Similarly, , and , . Function Description Complete the getTotalX function in the editor below. It should return the number of integers that are betwen the sets. getTotalX has the following parameter(s): a : an array of integers b : an array of integers Input Format Th...