add 1848

Author: clingoram

javascript/LeetCode/Array/1848.js

@@ -0,0 +1,27 @@
+/**
+ * 1848. Minimum Distance to the Target Element
+ * 
+ * @param {number[]} nums
+ * @param {number} target
+ * @param {number} start
+ * @return {number}
+ */
+var getMinDistance = function(nums, target, start) {
+    /**
+     * nums[i] === target
+     * 找最小的abs(i - start)
+     */
+    let minDistance = Infinity;
+    for(let i = 0;i < nums.length;++i) {
+      if(nums[i] === target){
+        minDistance = Math.min(minDistance,Math.abs(i - start));
+      }
+    }
+    return minDistance;
+};
+// let nums = [1,2,3,4,5], target = 5, start = 3
+// Output: 1
+// Explanation: nums[4] = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.
+let nums = [1,1,1,1,1,1,1,1,1,1], target = 1, start = 9;
+// 0
+console.log(getMinDistance(nums,target,start));

javascript/index.js

@@ -1392,3 +1392,30 @@ Explanation: The robot moves left twice. It ends up two "moves" to the left of t
 */
 // console.log(judgeCircle(moves));
 
+/**
+ * 3663. Find The Least Frequent Digit
+ * 
+ * @param {number} n
+ * @return {number}
+ */
+var getLeastFrequentDigit = function(n) {
+    /**
+     * 找出n中出現次數最少的數字有幾次，若有好幾個，則回傳最小數字
+     * 
+     * hash table
+     */
+    let nSplitToStr = n.toString().split("");
+    let map = new Map();
+    for(let i = 0;i < nSplitToStr.length;++i) {
+      map.has(nSplitToStr[i]) ? map.set(nSplitToStr[i],map.get(nSplitToStr[i])+1) : map.set(nSplitToStr[i],1);
+    }
+    console.log(map);
+
+};
+let n = 723344511;
+/*
+Output: 2
+Explanation:
+The least frequent digits in n are 7, 2, and 5; each appears only once.
+*/
+console.log(getLeastFrequentDigit(n));