add practice

Author: clingoram

javascript/LeetCode/Array/3289.js

@@ -0,0 +1,38 @@
+/**
+ * 3289. The Two Sneaky Numbers of Digitville
+ * 
+ * 參數為數值陣列，回傳元素出現次數大於2的元素。回傳的陣列每個必須是唯一值
+ * 
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var getSneakyNumbers = function(nums) {
+    // element出現次數 >= 2才能被保留
+    // 回傳的陣列元素必須是唯一值
+    // let map = new Map();
+    // let ans = [];
+    // for(let i = 0;i < nums.length;++i) {
+    //   map.has(nums[i]) ? map.set(nums[i],map.get(nums[i])+ 1) : map.set(nums[i],1);
+    // }
+    // for(const [key,value] of map) {
+    //   if(value >= 2){
+    //     ans.push(key);
+    //   }
+    // }
+    // return ans;
+
+    // solution 2.
+    let set = new Set();
+    let result = [];
+    for(let i = 0;i < nums.length;i++) {
+      if(set.has(nums[i])){
+        result.push(nums[i]);
+      }else{
+        set.add(nums[i]);
+      }
+    }
+    return result;
+};
+let nums = [0,1,1,0];
+// [0,1]
+console.log(getSneakyNumbers(nums));

javascript/index.js

@@ -1047,3 +1047,35 @@ let numerator = 1, denominator = 2;
 // "0.5"
 // console.log(fractionToDecimal(numerator,denominator));
 
+
+
+/**
+ * 3718. Smallest Missing Multiple of K
+ * 
+ * 取得能被k整除且是所有能被k整除的最小數且不在nums中的元素並回傳
+ * 
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var missingMultiple = function(nums, k) {
+ let divisibleByK = [];
+ let ans = 0;
+ for(let i = 1;i <= 5;++i) {
+    divisibleByK.push(i*k);
+ }
+ for(let i = 0;i < divisibleByK.length;++i) {
+    if(!nums.includes(divisibleByK[i])){
+        ans = divisibleByK[i];
+        break;
+    }
+ }
+ return ans;
+};
+// let nums = [1,4,7,10,15], k = 5;
+// 5
+// let nums = [8,2,3,4,6], k = 2;
+// 10
+let nums = [99],k = 99;
+// 198
+console.log(missingMultiple(nums,k));

python/index.py

@@ -26,8 +26,8 @@
 from oop.Lion import Lion
 from oop.Behavior import move
 
-greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
-greek.eat()
+# greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
+# greek.eat()
 # greek.hibernation()
 # greek.environment()
 # greek.attack()
@@ -267,3 +267,19 @@ def replaceDigits(s: str) -> str:
 # Output: "abcdef"
 # print(replaceDigits(s))
 
+def getSneakyNumbers(nums: List[int]) -> List[int]:
+  '''
+  3289. The Two Sneaky Numbers of Digitville
+  
+  參數為數值陣列，回傳元素出現次數大於2的元素。回傳的陣列每個必須是唯一值
+  '''
+  ans = []
+
+  return ans
+nums = [0,1,1,0]
+# [0,1]
+# print(getSneakyNumbers(nums))
+
+a = int(input("2 numbers"))
+
+print("A is:",a)