1487. 保证文件名唯一

Author: w2xi

README.md

@@ -214,6 +214,7 @@
 |1233|[删除子文件夹](https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/)|[JavaScript](./algorithms/remove-sub-folders-from-the-filesystem.js)|Medium|
 |1305|[两棵二叉搜索树中的所有元素](https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/)|[JavaScript](./algorithms/all-elements-in-two-binary-search-trees.js)|Medium|
 |1413|[逐步求和得到正数的最小值](https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum/)|[JavaScript](./algorithms/minimum-value-to-get-positive-step-by-step-sum.js)|Easy|
+|1487|[保证文件名唯一](https://leetcode.cn/problems/making-file-names-unique/)|[JavaScript](./algorithms/making-file-names-unique.js)|Medium|
 |1604|[警告一小时内使用相同员工卡大于等于三次的人](https://leetcode.cn/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)|[JavaScript](./algorithms/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.js)|Medium|
 |1664|[生成平衡数组的方案数](https://leetcode.cn/problems/ways-to-make-a-fair-array/)|[JavaScript](./algorithms/ways-to-make-a-fair-array.js)|Medium|
 |1669|[合并两个链表](https://leetcode.cn/problems/merge-in-between-linked-lists/)|[JavaScript](./algorithms/merge-in-between-linked-lists.js)|Medium|

algorithms/making-file-names-unique.js

@@ -0,0 +1,24 @@
+/**
+ * 1487. 保证文件名唯一
+ * @param {string[]} names
+ * @return {string[]}
+ */
+var getFolderNames = function (names) {
+  let map = new Map();
+
+  for (let i = 0; i < names.length; i++) {
+    const name = names[i];
+    if (map.has(name)) {
+      let cnt = map.get(name);
+      while (map.has(names[i])) {
+        names[i] = `${name}(${cnt++})`;
+      }
+      map.set(names[i], 1); // new name
+      map.set(name, cnt);
+    } else {
+      map.set(name, 1);
+    }
+  }
+
+  return names;
+};