2287. 重排字符形成目标字符串

Author: w2xi

README.md

@@ -178,6 +178,7 @@
 |1945|[字符串转化后的各位数字之和](https://leetcode.cn/problems/sum-of-digits-of-string-after-convert/)|[JavaScript](./algorithms/sum-of-digits-of-string-after-convert.js)|Easy|
 |2032|[至少在两个数组中出现的值](https://leetcode.cn/problems/two-out-of-three/)|[JavaScript](./algorithms/two-out-of-three.js)|Easy|
 |2283|[判断一个数的数字计数是否等于数位的值](https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/)|[JavaScript](./algorithms/check-if-number-has-equal-digit-count-and-digit-value.js)|Easy|
+|2287|[重排字符形成目标字符串](https://leetcode.cn/problems/rearrange-characters-to-make-target-string/)|[JavaScript](./algorithms/rearrange-characters-to-make-target-string.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/rearrange-characters-to-make-target-string.js

@@ -0,0 +1,34 @@
+/**
+ * [2287] 重排字符形成目标字符串
+ * @param {string} s
+ * @param {string} target
+ * @return {number}
+ */
+var rearrangeCharacters = function (s, target) {
+  // 思路: 分别统计 s target 中每个字符出现的次数，然后求最小倍数
+
+  let result = Number.MAX_VALUE;
+  const map1 = Array(26).fill(0);
+  const map2 = Array(26).fill(0);
+  for (let i = 0; i < s.length; i++) {
+    const index = s[i].charCodeAt() - 97;
+    map1[index]++;
+  }
+  for (let i = 0; i < target.length; i++) {
+    const index = target[i].charCodeAt() - 97;
+    map2[index]++;
+  }
+  for (let i = 0; i < map1.length; i++) {
+    const a = map1[i];
+    const b = map2[i];
+    const c = b ? Math.floor(a / b) : 0;
+
+    if (!a && b) {
+      return 0;
+    }
+    if (a && b) {
+      result = Math.min(result, c);
+    }
+  }
+  return result;
+};

vs-lt/2287.重排字符形成目标字符串.js

@@ -0,0 +1,42 @@
+/*
+ * @lc app=leetcode.cn id=2287 lang=javascript
+ *
+ * [2287] 重排字符形成目标字符串
+ */
+
+// @lc code=start
+/**
+ * @param {string} s
+ * @param {string} target
+ * @return {number}
+ */
+var rearrangeCharacters = function(s, target) {
+  // 思路: 分别统计 s target 中每个字符出现的次数，然后求最小倍数
+  
+  let result = Number.MAX_VALUE;
+  const map1 = Array(26).fill(0);
+  const map2 = Array(26).fill(0);
+  for (let i = 0; i < s.length; i++) {
+    const index = s[i].charCodeAt() - 97;
+    map1[index]++;
+  }
+  for (let i = 0; i < target.length; i++) {
+    const index = target[i].charCodeAt() - 97;
+    map2[index]++;
+  }
+  for (let i = 0; i < map1.length; i++) {
+    const a = map1[i];
+    const b = map2[i];
+    const c = b ? Math.floor(a / b) : 0;
+
+    if (!a && b) {
+      return 0;
+    }
+    if (a && b) {
+      result = Math.min(result, c);
+    }
+  }
+  return result;
+};
+// @lc code=end
+