Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit e7db5e3

Browse files
feat: add ts solution to lc problem: No.1405
1405.Longest Happy String
1 parent ac3bed4 commit e7db5e3

File tree

3 files changed

+85
-0
lines changed

3 files changed

+85
-0
lines changed

‎solution/1400-1499/1405.Longest Happy String/README.md‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -70,6 +70,36 @@
7070

7171
```
7272

73+
### **TypeScript**
74+
75+
```ts
76+
function longestDiverseString(a: number, b: number, c: number): string {
77+
let ans = [];
78+
let store: Array<[string, number]> = [['a', a], ['b', b], ['c', c]];
79+
while(true) {
80+
store.sort((a, b) => b[1] - a[1]);
81+
let hasNext = false;
82+
for (let [i, [ch, ctn]] of store.entries()) {
83+
if (ctn < 1) {
84+
break;
85+
}
86+
const n = ans.length;
87+
if (n >= 2 && ans[n - 1] == ch && ans[n - 2] == ch) {
88+
continue;
89+
}
90+
hasNext = true;
91+
ans.push(ch);
92+
store[i][1] -= 1;
93+
break;
94+
}
95+
if (!hasNext) {
96+
break;
97+
}
98+
}
99+
return ans.join('');
100+
};
101+
```
102+
73103
### **...**
74104

75105
```

‎solution/1400-1499/1405.Longest Happy String/README_EN.md‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -64,6 +64,36 @@
6464

6565
```
6666

67+
### **TypeScript**
68+
69+
```ts
70+
function longestDiverseString(a: number, b: number, c: number): string {
71+
let ans = [];
72+
let store: Array<[string, number]> = [['a', a], ['b', b], ['c', c]];
73+
while(true) {
74+
store.sort((a, b) => b[1] - a[1]);
75+
let hasNext = false;
76+
for (let [i, [ch, ctn]] of store.entries()) {
77+
if (ctn < 1) {
78+
break;
79+
}
80+
const n = ans.length;
81+
if (n >= 2 && ans[n - 1] == ch && ans[n - 2] == ch) {
82+
continue;
83+
}
84+
hasNext = true;
85+
ans.push(ch);
86+
store[i][1] -= 1;
87+
break;
88+
}
89+
if (!hasNext) {
90+
break;
91+
}
92+
}
93+
return ans.join('');
94+
};
95+
```
96+
6797
### **...**
6898

6999
```
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
function longestDiverseString(a: number, b: number, c: number): string {
2+
let ans = [];
3+
let store: Array<[string, number]> = [['a', a], ['b', b], ['c', c]];
4+
while(true) {
5+
store.sort((a, b) => b[1] - a[1]);
6+
let hasNext = false;
7+
for (let [i, [ch, ctn]] of store.entries()) {
8+
if (ctn < 1) {
9+
break;
10+
}
11+
const n = ans.length;
12+
if (n >= 2 && ans[n - 1] == ch && ans[n - 2] == ch) {
13+
continue;
14+
}
15+
hasNext = true;
16+
ans.push(ch);
17+
store[i][1] -= 1;
18+
break;
19+
}
20+
if (!hasNext) {
21+
break;
22+
}
23+
}
24+
return ans.join('');
25+
};

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /