Skip to content

Commit 40c7e69

Browse files
authored
feat: add solutions to lc problem: No.1487 (doocs#905)
No.1487.Making File Names Unique
1 parent 9137782 commit 40c7e69

File tree

3 files changed

+55
-0
lines changed

3 files changed

+55
-0
lines changed

solution/1400-1499/1487.Making File Names Unique/README.md

+20
Original file line numberDiff line numberDiff line change
@@ -177,6 +177,26 @@ func getFolderNames(names []string) []string {
177177
}
178178
```
179179

180+
### **TypeScript**
181+
182+
```ts
183+
function getFolderNames(names: string[]): string[] {
184+
let d: Map<string, number> = new Map();
185+
for (let i = 0; i < names.length; ++i) {
186+
if (d.has(names[i])) {
187+
let k: number = d.get(names[i]) || 0;
188+
while (d.has(names[i] + '(' + k + ')')) {
189+
++k;
190+
}
191+
d.set(names[i], k);
192+
names[i] += '(' + k + ')';
193+
}
194+
d.set(names[i], 1);
195+
}
196+
return names;
197+
}
198+
```
199+
180200
### **...**
181201

182202
```

solution/1400-1499/1487.Making File Names Unique/README_EN.md

+20
Original file line numberDiff line numberDiff line change
@@ -141,6 +141,26 @@ func getFolderNames(names []string) []string {
141141
}
142142
```
143143

144+
### **TypeScript**
145+
146+
```ts
147+
function getFolderNames(names: string[]): string[] {
148+
let d: Map<string, number> = new Map();
149+
for (let i = 0; i < names.length; ++i) {
150+
if (d.has(names[i])) {
151+
let k: number = d.get(names[i]) || 0;
152+
while (d.has(names[i] + '(' + k + ')')) {
153+
++k;
154+
}
155+
d.set(names[i], k);
156+
names[i] += '(' + k + ')';
157+
}
158+
d.set(names[i], 1);
159+
}
160+
return names;
161+
}
162+
```
163+
144164
### **...**
145165

146166
```
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
function getFolderNames(names: string[]): string[] {
2+
let d: Map<string, number> = new Map();
3+
for (let i = 0; i < names.length; ++i) {
4+
if (d.has(names[i])) {
5+
let k: number = d.get(names[i]) || 0;
6+
while (d.has(names[i] + '(' + k + ')')) {
7+
++k;
8+
}
9+
d.set(names[i], k);
10+
names[i] += '(' + k + ')';
11+
}
12+
d.set(names[i], 1);
13+
}
14+
return names;
15+
}

0 commit comments

Comments
 (0)