Movatterモバイル変換

[0]ホーム
URL:

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

Commit86d2f0f

Browse files
committed
update: 316
1 parent0ac110b commit86d2f0f

File tree

2 files changed

+52
-0
lines changed

2 files changed

+52
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -135,6 +135,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
135135
| 309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-with-cooldown/res.js)| Medium|
136136
| 310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)|[JavaScript](./src/minimum-height-trees/res.js)| Medium|
137137
| 315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) <sup>*</sup>|[JavaScript](./src/count-of-smaller-numbers-after-self/res.js)| Hard|
138+
| 316|[remove-duplicate-letters](https://leetcode.com/problems/remove-duplicate-letters/)|[TypeScript](./src/remove-duplicate-letters/res.ts)| Medium|
138139
| 322|[Coin Change](https://leetcode.com/problems/coin-change/)|[JavaScript](./src/coin-change/res.js)| Medium|
139140
| 327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[JavaScript](./src/count-of-range-sum/res.js)| Hard|
140141
| 334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)|[JavaScript](./src/increasing-triplet-subsequence/res.js)| Medium|

‎src/remove-duplicate-letters/res.ts

Lines changed: 51 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,51 @@
1+
functionremoveDuplicateLetters(s:string):string{
2+
if(s.length<=1){
3+
returns;
4+
}
5+
6+
constsList=s.split('');
7+
constsCountMap:{[keyinstring]:number}={};
8+
sList.map(str=>{
9+
sCountMap[str]=sCountMap[str] ?sCountMap[str]+1 :1;
10+
});
11+
12+
constremainCountMap:{[keyinstring]:number}=JSON.parse(JSON.stringify(sCountMap));
13+
constresultCountMap:{[keyinstring]:number}={};
14+
15+
Object.keys(sCountMap).forEach(key=>resultCountMap[key]=0);
16+
constsStack=[sList[0]];
17+
resultCountMap[sList[0]]=1;
18+
remainCountMap[sList[0]]-=1;
19+
20+
for(leti=1;i<sList.length;i++){
21+
constelement=sList[i];
22+
constprevElement=sStack[sStack.length-1];
23+
if(!resultCountMap[element]&&element>prevElement){
24+
sStack.push(element);
25+
remainCountMap[element]-=1;
26+
resultCountMap[element]=1;
27+
}elseif(!resultCountMap[element]&&element<prevElement){
28+
letcurrentIndex=sStack.length-1;
29+
while(currentIndex>=0){
30+
constcurrentPrevElement=sStack[currentIndex];
31+
if(currentPrevElement>element&&remainCountMap[currentPrevElement]){
32+
currentIndex--;
33+
}else{
34+
break;
35+
}
36+
}
37+
constsStackLength=sStack.length;
38+
for(letj=currentIndex+1;j<sStackLength;j++){
39+
constminusElement=sStack.pop()asstring;
40+
resultCountMap[minusElement]--;
41+
}
42+
sStack.push(element);
43+
remainCountMap[element]--;
44+
resultCountMap[element]++;
45+
}else{
46+
remainCountMap[element]--;
47+
}
48+
}
49+
50+
returnsStack.join('');
51+
};

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp