add 1967

Author: clingoram

javascript/LeetCode/Array/1967.js

@@ -0,0 +1,31 @@
+/**
+ * 1967. Number of Strings That Appear as Substrings in Word
+ * 
+ * @param {string[]} patterns
+ * @param {string} word
+ * @return {number}
+ */
+var numOfStrings = function(patterns, word) {
+    /**
+     * 計算patterns中有幾個元素出現在word中
+     */
+    let count = 0;
+    for(let i = 0;i < patterns.length;++i) {
+      if(word.includes(patterns[i])){
+        count++;
+      }
+    }
+    return count;
+};
+let patterns = ["a","abc","bc","d"], word = "abc";
+/*
+Output: 3
+Explanation:
+- "a" appears as a substring in "abc".
+- "abc" appears as a substring in "abc".
+- "bc" appears as a substring in "abc".
+- "d" does not appear as a substring in "abc".
+3 of the strings in patterns appear as a substring in word.
+*/
+console.log(numOfStrings(patterns,word));
+

javascript/index.js

@@ -1409,4 +1409,24 @@ var findErrorNums = function(nums) {
 };
 let nums = [1,2,2,4];
 // [2,3]
-console.log(findErrorNums(nums));
+// console.log(findErrorNums(nums));
+
+
+/**
+ * 2864. Maximum Odd Binary Number
+ * 
+ * @param {string} s
+ * @return {string}
+ */
+var maximumOddBinaryNumber = function(s) {
+    /**
+    * binary string s包含至少一個'1'
+    * rearrange 參數s成最大的奇二進制數
+    * 回傳的結果值開頭可以是0
+    */
+   
+};
+let s = "010";
+// Output: "001"
+// Explanation: Because there is just one '1', it must be in the last position. So the answer is "001".
+console.log(maximumOddBinaryNumber(s));