Package g3101_3200.s3162_find_the_number_of_good_pairs_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3162 - Find the Number of Good Pairs I.

    Easy

    You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.

    A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).

    Return the total number of good pairs.

    Example 1:

    Input: nums1 = 1,3,4, nums2 = 1,3,4, k = 1

    Output: 5

    Explanation:

    The 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).

    Example 2:

    Input: nums1 = 1,2,4,12, nums2 = 2,4, k = 3

    Output: 2

    Explanation:

    The 2 good pairs are (3, 0) and (3, 1).

    Constraints:

    • 1 <= n, m <= 50

    • 1 <= nums1[i], nums2[j] <= 50

    • 1 <= k <= 50

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numberOfPairs(IntArray nums1, IntArray nums2, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait