feat: 2022-06-26-huatai-FINTECH

Author: upupming

2022-online-assessments/2022-06-26-huatai-FINTECH/小华拼单词.js

@@ -0,0 +1,16 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+
+process.stdin.on('end', () => {
+  const cnt = input.split('\n')[0].split(' ').map(Number)
+  let ans = 1e10
+  const s = 'huatai'
+  for (let ch of s) {
+    let c = 0
+    for (let i = 0; i < s.length; i++) if (s[i] === ch) c++
+    let x = cnt[ch.charCodeAt(0) - 'a'.charCodeAt(0)]
+    ans = Math.min(ans, Math.floor(x / c))
+  }
+  console.log(ans)
+})

2022-online-assessments/2022-06-26-huatai-FINTECH/股票买卖的最大收益.js

@@ -0,0 +1,33 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  const [n, k, x] = lines[0].split(' ').map(Number)
+  const a = lines[1].split(' ').map(Number)
+  const dp = []
+  // 0: 不操作,1: 卖出,2: 买入
+  dp[0] = [null, [x, 0], [0, 0]]
+  for (let i = 1; i <= n; i++) {
+    dp[i] = []
+    let idx = -1, maxV = -1
+    for (let j = 1; j < 3; j++) {
+      const v = dp[i-1][j][0] * a[i-1] + dp[i-1][j][1]
+      if(v > maxV) {
+        idx = j
+        maxV = v
+      }
+    }
+    dp[i][1] = [0, maxV]
+    let ck = Math.min(Math.floor(maxV / a[i-1]), k)
+    dp[i][2] = [ck, maxV - a[i-1] * ck]
+  }
+  let ans = 0
+//   console.log(dp)
+  for (let j = 1; j < 3; j++) {
+    const v = dp[n][j][0] * a[n-1] + dp[n][j][1]
+    ans = Math.max(ans, v)
+  }
+  console.log(ans)
+})

2022-online-assessments/2022-06-26-huatai-FINTECH/运货.js

@@ -0,0 +1,50 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  const [n] = lines[0].split(' ').map(Number)
+  const edges = lines.slice(1, n).map(line => line.split(' ').map(Number))
+  const e = Array(n + 1).fill(0).map(() => [])
+  for (const [x, y] of edges) {
+    e[x].push(y)
+    e[y].push(x)
+  }
+  const fa = Array(n + 1).fill(0).map((_, idx) => idx)
+  const sz = Array(n + 1).fill(1)
+  const get = (i) => {
+    if (fa[i] === i) return i
+    return fa[i] = get(fa[i])
+  }
+  const merge = (i, j) => {
+    const fi = get(i); const fj = get(j)
+    if (fi === fj) return
+    const si = sz[fi]; const sj = sz[fj]
+    if (si < sj) {
+      fa[fi] = fj
+      sz[fj] += si
+    } else {
+      fa[fj] = fi
+      sz[fi] += sj
+    }
+  }
+  let ans = 0; const P = (1e9 + 7)
+  const Pn = BigInt(P)
+  for (let i = 1; i <= n; i++) {
+    let prod = 1n
+    for (const j of e[i]) {
+      if (j < i) {
+        const fi = get(i); const fj = get(j)
+        const sj = sz[fj]
+        if (fi !== fj) {
+          merge(i, j)
+          ans += Number(BigInt(sj) * BigInt(i) * prod % Pn)
+          ans %= P
+        }
+        prod += BigInt(sj)
+      }
+    }
+  }
+  console.log(ans)
+})

2022-online-assessments/README.md

@@ -2,3 +2,4 @@
 
 - [2022-03-15-hulu](2022-03-15-hulu)
 - [2022-04-24-tencent 腾讯实习前端笔试](2022-04-24-tencent)
+- [2022-06-26-huatai-FINTECH 华泰 FINTECH 竞赛](2022-06-26-huatai-FINTECH), [竞赛地址](https://competition.nowcoder.com/3/introduce), Rank 79

leetcode/contest-287/5302. Encrypt and Decrypt Strings.js

@@ -38,6 +38,10 @@ Encrypter.prototype.decrypt = function (word2) {
     for (let b = 0; b < d.length; b++) {
       const ch = d[b]
       const i = this.km[ch]
+      if (i == null) {
+        ok = false
+        break
+      }
       const p = this.values[i]
       for (let j = 0; j < p.length; j++) {
         if (p[j] === word2[idx]) idx++