feat(rank): ✨整理 5368

Author: descire

Rank/182/5368/solution1.js

@@ -0,0 +1,34 @@
+/**
+ * 
+ * https://leetcode-cn.com/problems/find-lucky-integer-in-an-array/
+ * 
+ * Easy
+ * 
+ * 5368. 找出数组中的幸运数
+ * 
+ * - 哈希表
+ * 
+ * 60ms 100.00%
+ * 
+ * 35.7mb 100.00%
+ * 
+ * 时间复杂度 O(n)
+ * 空间复杂度 O(n)
+ */
+const findLucky = arr => {
+  const record = new Map();
+  for (let i = 0; i < arr.length; i++) {
+    if (!record.get(arr[i])) {
+      record.set(arr[i], 0);
+    }
+    record.set(arr[i], record.get(arr[i]) + 1);
+  }
+  let ans = -1;
+  for (const [key, value] of record.entries()) {
+    if (+key === +value) {
+      ans = Math.max(ans, +key);
+    }
+  }
+
+  return ans;
+}

Rank/182/solution2.js

@@ -0,0 +1,26 @@
+const numTeams = rating => {
+  let ans = 0;
+  const max = rating.length;
+  for (let i = 0; i < max; i++) {
+    for (let j = i + 1; j < max; j++) {
+      for (let k = j + 1; k < max; k++) {
+        if (rating[i] < rating[j] && rating[j] < rating[k]) {
+          ans++;
+        }
+
+        if (rating[i] > rating[j] && rating[j] > rating[k]) {
+          ans++;
+        }
+      }
+    }
+  }
+
+  return ans;
+}
+
+function getCount(count) {
+  if (count < 3) {
+    return 0;
+  }
+  return count * (count - 1) * (count - 2) / 6
+}

Rank/182/solution3.js

@@ -0,0 +1,42 @@
+
+var UndergroundSystem = function() {
+  this.inMap = new Map();
+  this.resultMap = new Map();
+};
+
+/** 
+ * @param {number} id 
+ * @param {string} stationName 
+ * @param {number} t
+ * @return {void}
+ */
+UndergroundSystem.prototype.checkIn = function(id, stationName, t) {
+  this.inMap.set(id, [stationName, t]);
+};
+
+/** 
+ * @param {number} id 
+ * @param {string} stationName 
+ * @param {number} t
+ * @return {void}
+ */
+UndergroundSystem.prototype.checkOut = function(id, stationName, t) {
+  const [startStation, startT] = this.inMap.get(id);
+  const time = t - startT;
+  if (!this.resultMap.has(`${startStation}-${stationName}`)) {
+    this.resultMap.set(`${startStation}-${stationName}`, []);
+  }
+  this.resultMap.get(`${startStation}-${stationName}`).push(time);
+  this.inMap.delete(id);
+};
+
+/** 
+ * @param {string} startStation 
+ * @param {string} endStation
+ * @return {number}
+ */
+UndergroundSystem.prototype.getAverageTime = function(startStation, endStation) {
+  const list = this.resultMap.get(`${startStation}-${endStation}`);
+  const max = list.length;
+  return list.reduce((a, b) => a + b, 0) / max;
+};

Rank/182/solution4.js

@@ -0,0 +1,56 @@
+const MAX_INT = 10 ** 9 + 7;
+const findGoodStrings = (n, s1, s2, evil) => {
+  let ans = 0;
+
+  if (n === 0) {
+    return 0;
+  }
+
+  let c1 = 0
+  for (let i = s1[0].charCodeAt(0) + 1; i < s2[0].charCodeAt(0); i++) {
+    if (evil.indexOf(String.fromCharCode(i)) === -1) {
+      c1++;
+    }
+  }
+  ans += getCount(c1, evil.length, n - 1);
+
+  for (let i = 1; i < s1.length; i++) {
+    const item = s1[i];
+    let count = 0;
+    let start = item.charCodeAt(0);
+    let max1 = s1[i - 1] === s2[i - 1] ? s2[i].charCodeAt(0) : 122;
+    while (start <= max1) {
+      if (evil.indexOf(String.fromCharCode(start)) === -1) {
+        count++;
+      }
+      start++;
+    }
+    ans += getCount(count, evil.length, n - i - 1);
+
+    if(s2[i - 1] !== s1[i - 1]) {
+      const item2 = s2[i];
+      let count2 = 0;
+      let start2 = item2.charCodeAt(0);
+      while (start2 >= s1[i].charCodeAt(0)) {
+        if (evil.indexOf(String.fromCharCode(start2)) === -1) {
+          count2++;
+        }
+        start2--;
+      }
+
+      ans += getCount(count2, evil.length, n - i - 1);
+    }
+      
+  }
+  return ans;
+}
+
+function getCount(count, length, n) {
+  let ans = count;
+  while (n > 0) {
+    ans *= (26 - length);
+    ans %= MAX_INT;
+    n--;
+  }
+  return ans;
+}