3162. 优质数对的总数 I

java">package JavaExercise20241010;public class JavaExercise {
}class Solution {public int numberOfPairs(int[] nums1, int[] nums2, int k) {int sum = 0;int length1 = nums1.length;int length2 = nums2.length;for (int i = 0; i < length1; i++) {for (int j = 0; j < length2; j++) {if (nums1[i] % (nums2[j] * k) == 0) {sum++;}}}return sum;}
}