add 2 problems

Author: clingoram

javascript/LeetCode/Array/3162.js

@@ -0,0 +1,40 @@
+/**
+ * 3162. Find the Number of Good Pairs I
+ * 
+ * good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @param {number} k
+ * @return {number}
+ */
+var numberOfPairs = function(nums1, nums2, k) {
+  // solution 1.
+  // let count = 0;
+  // for(let i = 0;i < nums1.length;i++) {
+  //   for(let j = 0;j < nums2.length;j++) {
+  //     if(nums1[i] % (nums2[j] * k) == 0){
+  //       count++;
+  //     }
+  //   }
+  // }
+  // return count;
+
+  // solution 2.
+  let count = 0;
+  let map = new Map();
+  for(let i of nums2) {
+    map.set(i,(map.get(i) || 0 ) + 1);
+  }
+  for(let i of nums1) {
+    // kwy mean j.
+    for(const [key,value] of map) {
+      if(i % (key * k)=== 0){
+        count+= value;
+      }
+    }
+  }
+  return count;
+};
+let nums1 = [1,3,4], nums2 = [1,3,4], k = 1;
+// 5
+console.log(numberOfPairs(nums1,nums2,k))

javascript/LeetCode/Array/3477.js

@@ -0,0 +1,46 @@
+/**
+ * 3477. Fruits Into Baskets II
+ * 
+ * 參數為兩個數值陣列，fruits,baskets。
+ * fruits表示每種水果的數量;baskets表示籃子最多可裝幾個
+ * 
+ * 從左到右須遵守：
+ * 每種水果要放在>=它的位置上
+ * 每個籃子最多只能裝一種水果
+ * 若水果無法裝進任何籃子，unplaced
+ * 
+ * 回傳有幾個unplaced
+ * @param {number[]} fruits
+ * @param {number[]} baskets
+ * @return {number}
+ */
+var numOfUnplacedFruits = function(fruits, baskets) {
+  // 要找出有幾樣水果無法放進籃子內
+  // 能放進去的規則：籃子的容量必須要 >= 水果
+  let unplaced = 0;
+  for(let i = 0;i < fruits.length;i++) {
+    let placed = false;
+    for(let j = 0;j < baskets.length;j++) {
+      if(fruits[i] <= baskets[j]){
+        baskets[j]= -1; // 標記籃子有使用
+        placed = true;
+        break;
+      }
+    }
+    if(!placed){
+      unplaced++;
+    }
+  }
+  return unplaced;
+};
+// let fruits = [4,2,5], baskets = [3,5,4];
+/**
+ * 1
+ * fruits[0] = 4 is placed in baskets[1] = 5.
+ * fruits[1] = 2 is placed in baskets[0] = 3.
+ * fruits[2] = 5 cannot be placed in baskets[2] = 4.
+ * Since one fruit type remains unplaced, we return 1.
+ */
+let fruits = [1,4], baskets = [8,1];
+// 1
+console.log(numOfUnplacedFruits(fruits,baskets));

javascript/index.js

@@ -1028,3 +1028,4 @@ var closetPair = function(arr1,arr2,x) {
 // [1,30];
 // console.log(closetPair(arr1,arr2,x));
 
+