add new solution

Author: clingoram

javascript/LeetCode/Array/3151.js

@@ -0,0 +1,27 @@
+/**
+ * 3151. Special Array I
+ * 
+ * 檢查陣列任兩個相鄰元素的奇偶性是否都不同。若是回傳true
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var isArraySpecial = function(nums) {
+  if(nums.length === 1){
+    return true;
+  }
+  for(let i = 0;i < nums.length;++i) {
+    let previous = nums[i];
+    let next = nums[i + 1];
+    if(previous % 2 !== next % 2){
+      continue;
+    }else{
+      return false;
+    }
+  }
+  return true;
+};
+// let nums = [4,3,1,6];
+// false
+let nums = [2,1];
+// true
+console.log(isArraySpecial(nums))

javascript/index.js

@@ -1158,7 +1158,7 @@ var specialTriplets = function(nums) {
     }
     console.log(ans)
 };
-let nums = [8,4,2,8,4];
+// let nums = [8,4,2,8,4];
 /**
  * 2
  * 
@@ -1175,6 +1175,28 @@ let nums = [8,4,2,8,4];
  */
 // console.log(specialTriplets(nums));
 
-
-
-
+/**
+ * 2119. A Number After a Double Reversal
+ * 
+ * 將參數nums反轉2次後，檢查是否還是跟原參數一樣
+ * @param {number} num
+ * @return {boolean}
+ */
+var isSameAfterReversals = function(num) {
+  // 可能遇到的狀況：數字反轉後，前面是0
+    let countReverseTimes = 0;
+    // let nStr = 0;
+    let copyNum = num;
+    let toStr = num.toString().split("");
+    for(let i = 0;i < toStr.length;++i) {
+      if(countReverseTimes !== 2){
+        toStr = parseInt(toStr.reverse().join(""));
+        countReverseTimes++;
+      }
+    }
+    console.log(toStr)
+    return toStr === copyNum;
+};
+let num = 526;
+// false
+console.log(isSameAfterReversals(num));