solve 2 problems and no.2315 unsolve.

Author: clingoram

javascript/LeetCode/String/1021.js

@@ -0,0 +1,32 @@
+/**
+ * 1021. Remove Outermost Parentheses
+ * 
+ * @param {string} s
+ * @return {string}
+ */
+var removeOuterParentheses = function(s) {
+  // () 須相等數量，才能變成一對
+  let splitS = s.split("");
+  let res = "";
+  let count = 1;
+  for(let i = 1; i < splitS.length;++i) {
+    if(splitS[i] === "("){
+      count++;
+      if(count > 1){
+        res += "(";
+      }
+    }else{
+      if(count > 1){
+        res += ")";
+      }
+      count--;
+    }
+  }
+  return res;
+};
+// let s = "(()())(())"
+// "()()()"
+let s = "(()())(())(()(()))";
+// "()()()()(())"
+// "(()()) (())(()(()))" => (()())
+console.log(removeOuterParentheses(s));

javascript/LeetCode/String/1844.js

@@ -0,0 +1,33 @@
+/**
+ * 1844. Replace All Digits with Characters
+ * 
+ * @param {string} s
+ * @return {string}
+ */
+var replaceDigits = function(s) {
+  const reg = new RegExp('^[0-9]+$');
+    // 數字前面的一個字母表示該字母要往後增加幾個才能變成新字母。a2 => a後面的第2個字母，回傳ac
+    // 數字所在index都是奇數
+    let res = "";
+    for(let i = 0;i < s.length;++i) {
+      // 前一個（字母）
+      let prev = s[i - 1];
+      // 目前所在位置（數字）
+      let next = s[i];
+      if(i % 2 !== 0){
+        // char.charCodeAt() 取得ascii
+        // ascii 轉字母 String.fromCharCode(ascii)
+        res += String.fromCharCode(prev.charCodeAt() + parseInt(next))
+      }else{
+        res += s[i];
+      }
+    }
+    return res;
+};
+let s = "a1c1e1"
+// Output: "abcdef"
+// Explanation: The digits are replaced as follows:
+// - s[1] -> shift('a',1) = 'b'
+// - s[3] -> shift('c',1) = 'd'
+// - s[5] -> shift('e',1) = 'f'
+console.log(replaceDigits(s));

javascript/index.js

@@ -1048,34 +1048,33 @@ let numerator = 1, denominator = 2;
 // console.log(fractionToDecimal(numerator,denominator));
 
 /**
- * 1021. Remove Outermost Parentheses
+ * 2315. Count Asterisks
  * 
+ * 給一個字串，字串中可能會有"|"和"*"，找出字串中被一組 | 包住的連續 ** 有幾個
  * @param {string} s
- * @return {string}
+ * @return {number}
  */
-var removeOuterParentheses = function(s) {
-  // () 須相等數量，才能變成一對
+var countAsterisks = function(s) {
+  // 須判斷字串中是否有"*"符號
+  // 拆成陣列，計算一組"|"中有幾個連續"*"
   let splitS = s.split("");
-  let res = "";
-  let count = 1;
-  for(let i = 1; i < splitS.length;++i) {
-    if(splitS[i] === "("){
-      count++;
-      if(count > 1){
-        res += "(";
-      }
-    }else{
-      if(count > 1){
-        res += ")";
+  let ans = 0;
+  let pairs = false;
+  for(let i = 0;i < splitS.length;++i) {
+    if(splitS[i] === "|"){
+      if(pairs){
+        pairs = true;
+        continue;
+      }else{
+        pairs = false;
       }
-      count--;
     }
+
   }
-  return res;
+  return ans;
 };
-// let s = "(()())(())"
-// "()()()"
-let s = "(()())(())(()(()))";
-// "()()()()(())"
-// "(()()) (())(()(()))" => (()())
-console.log(removeOuterParentheses(s));
+// let s = "l|*e*et|c**o|*de|"
+// Output: 2
+let s = "yo|uar|e**|b|e***au|tifu|l";
+// 5
+console.log(countAsterisks(s))

python/index.py

@@ -20,19 +20,19 @@
 
 # oop
 # from file name(module) import the class.
-from oop.Animal import Animal
-from oop.Tortoise import Tortoise
-from oop.Lion import Lion
-from oop.Behavior import move
-
-greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
-greek.eat()
-greek.hibernation()
-greek.environment()
-greek.attack()
-greek.affend()
-print(greek.specice)
-print(greek.avgWeight(7,5))
+# from oop.Animal import Animal
+# from oop.Tortoise import Tortoise
+# from oop.Lion import Lion
+# from oop.Behavior import move
+
+# greek = Tortoise("福氣",7,"veggie","地中海型陸龜")
+# greek.eat()
+# greek.hibernation()
+# greek.environment()
+# greek.attack()
+# greek.affend()
+# print(greek.specice)
+# print(greek.avgWeight(7,5))
 
 # lion = Lion("獅子","未知","肉食")
 # lion.eat()
@@ -250,3 +250,18 @@ def isPrime(element:int):
 # print(closestPrimes(left,right))
 
 
+def replaceDigits(s: str) -> str:
+  res = ""
+  for i in range(len(s)):
+    prev = s[i - 1]
+    current = s[i]
+
+    if i % 2 != 0:
+      res += chr(ord(prev) + int(current)) 
+    else:
+      res += s[i]
+  
+  return res
+s = "a1c1e1"
+# Output: "abcdef"
+print(replaceDigits(s))