add 2442

Author: clingoram

javascript/LeetCode/Array/2442.js

@@ -0,0 +1,23 @@
+/**
+ * 2442. Count Number of Distinct Integers After Reverse Operations
+ * 
+ * 計算陣列元素digits反轉後，加上原有陣列會有幾個數字是唯一值
+ * 
+ * @param {number[]} nums
+ * @return {number}
+ */
+var countDistinctIntegers = function(nums) {
+    // O(N)
+    nums.push(...nums.map(num => 
+      parseInt(num.toString().split('').reverse().join(''))
+    ));
+    return new Set(nums).size;
+};
+let nums = [1,13,10,12,31];
+/*
+Output: 6
+Explanation: After including the reverse of each number, the resulting array is [1,13,10,12,31,1,31,1,21,13].
+The reversed integers that were added to the end of the array are underlined. Note that for the integer 10, after reversing it, it becomes 01 which is just 1.
+The number of distinct integers in this array is 6 (The numbers 1, 10, 12, 13, 21, and 31).
+*/
+console.log(countDistinctIntegers(nums));

javascript/index.js

@@ -147,7 +147,7 @@ var multiply = function (num1, num2) {
 // "56088"
 const num1 = "123456789",num2 = "987654321"; 
 // "121932631112635269"
-console.log(multiply(num1, num2));
+// console.log(multiply(num1, num2));ㄋㄋ