feat: leetcode contest 297

Author: upupming

leetcode/contest-297/5259. Calculate Amount Paid in Taxes.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[][]} brackets
+ * @param {number} income
+ * @return {number}
+ */
+const calculateTax = function (b, inn) {
+  let ans = 0
+  for (let i = 0; i < b.length; i++) {
+    const [x, y] = b[i]
+    if (inn >= x) ans += (x - (b[i - 1]?.[0] ?? 0)) * y / 100
+    else {
+      ans += (inn - (b[i - 1]?.[0] ?? 0)) * y / 100
+      break
+    }
+  }
+  return ans
+}

leetcode/contest-297/5270. Minimum Path Cost in a Grid.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[][]} grid
+ * @param {number[][]} moveCost
+ * @return {number}
+ */
+ var minPathCost = function(g, mc) {
+  const m = g.length, n = g[0].length
+  const dp = Array(m).fill(0).map(() => [])
+  for (let i = 0; i < n; i++) dp[0][i] = g[0][i]
+  let ans = 1e10
+  for (let i = 1; i < m; i++) {
+      for (let j = 0; j < n; j++) {
+          dp[i][j] = 1e10
+          for (let k = 0; k < n; k++) {
+              dp[i][j] = Math.min(dp[i][j], dp[i-1][k] + mc[g[i-1][k]][j] + g[i][j])
+          }
+          if (i === m-1) ans = Math.min(ans, dp[i][j])
+      }
+  }
+  return ans
+};

leetcode/contest-297/5289. Fair Distribution of Cookies.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} cookies
+ * @param {number} k
+ * @return {number}
+ */
+ var distributeCookies = function(ck, k) {
+  let ans = 1e10
+  const n = ck.length
+  const dfs = (x, s) => {
+      let max = Math.max(...s)
+      if (max >= ans) return
+      if (x === n) {
+          ans = Math.min(ans, max)
+          return
+      }
+      for (let i = 0; i < k; i++) {
+          s[i] += ck[x]
+          dfs(x+1, s)
+          s[i] -= ck[x]
+      }
+  }
+  dfs(0, Array(k).fill(0))
+  return ans
+};

leetcode/contest-297/6094. Naming a Company.js

@@ -0,0 +1,32 @@
+/**
+ * @param {string[]} ideas
+ * @return {number}
+ */
+const distinctNames = function (is) {
+  const s = new Set(is)
+  // cnt[x][y] 表示把首字母从 x 改成 y 以后就不在 ideas 里的字符串数量
+  const cnt = {}
+  for (const t of is) {
+    const old = t[0]
+    cnt[old] ??= {}
+    for (let i = 0; i < 26; i++) {
+      const now = String.fromCharCode('a'.charCodeAt(0) + i)
+      cnt[old][now] ??= 0
+      if (!s.has(now + t.slice(1))) cnt[old][now]++
+    }
+  }
+  let ans = 0
+  for (const t of is) {
+    for (let i = 0; i < 26; i++) {
+      const y = String.fromCharCode('a'.charCodeAt(0) + i)
+      if (s.has(y + t.slice(1))) continue
+      ans += cnt[y]?.[t[0]] ?? 0
+    }
+  }
+  return ans
+}
+
+/*
+["aaa","baa","caa","bbb","cbb","dbb"]
+2
+*/