Skip to content

feat: add typescript solution to lc problem: No.0076.Minimum Window S… #458

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 16, 2021
Merged

feat: add typescript solution to lc problem: No.0076.Minimum Window S… #458

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
42 changes: 42 additions & 0 deletions solution/0000-0099/0076.Minimum Window Substring/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,6 +40,8 @@

## 解法

滑动窗口

<!-- 这里可写通用的实现逻辑 -->

<!-- tabs:start -->
Expand All @@ -60,6 +62,46 @@

```

### **TypeScript**

```ts
function minWindow(s: string, t: string): string {
let n1 = s.length, n2 = t.length;
if (n1 < n2) return '';
let need = new Array(128).fill(0);
let window = new Array(128).fill(0);
for (let i = 0; i < n2; ++i) {
++need[t.charCodeAt(i)];
}

let left = 0, right = 0;
let res = '';
let count = 0;
let min = n1 + 1;
while (right < n1) {
let cur = s.charCodeAt(right);
++window[cur];
if (need[cur] > 0 && need[cur] >= window[cur]) {
++count;
}
while (count == n2) {
cur = s.charCodeAt(left);
if (need[cur] > 0 && need[cur] >= window[cur]) {
--count;
}
if (right - left + 1 < min) {
min = right - left + 1;
res = s.slice(left, right + 1);
}
--window[cur];
++left;
}
++right;
}
return res;
};
```

### **...**

```
Expand Down
40 changes: 40 additions & 0 deletions solution/0000-0099/0076.Minimum Window Substring/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,6 +43,46 @@

```

### **TypeScript**

```ts
function minWindow(s: string, t: string): string {
let n1 = s.length, n2 = t.length;
if (n1 < n2) return '';
let need = new Array(128).fill(0);
let window = new Array(128).fill(0);
for (let i = 0; i < n2; ++i) {
++need[t.charCodeAt(i)];
}

let left = 0, right = 0;
let res = '';
let count = 0;
let min = n1 + 1;
while (right < n1) {
let cur = s.charCodeAt(right);
++window[cur];
if (need[cur] > 0 && need[cur] >= window[cur]) {
++count;
}
while (count == n2) {
cur = s.charCodeAt(left);
if (need[cur] > 0 && need[cur] >= window[cur]) {
--count;
}
if (right - left + 1 < min) {
min = right - left + 1;
res = s.slice(left, right + 1);
}
--window[cur];
++left;
}
++right;
}
return res;
};
```

### **...**

```
Expand Down
35 changes: 35 additions & 0 deletions solution/0000-0099/0076.Minimum Window Substring/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
function minWindow(s: string, t: string): string {
let n1 = s.length, n2 = t.length;
if (n1 < n2) return '';
let need = new Array(128).fill(0);
let window = new Array(128).fill(0);
for (let i = 0; i < n2; ++i) {
++need[t.charCodeAt(i)];
}

let left = 0, right = 0;
let res = '';
let count = 0;
let min = n1 + 1;
while (right < n1) {
let cur = s.charCodeAt(right);
++window[cur];
if (need[cur] > 0 && need[cur] >= window[cur]) {
++count;
}
while (count == n2) {
cur = s.charCodeAt(left);
if (need[cur] > 0 && need[cur] >= window[cur]) {
--count;
}
if (right - left + 1 < min) {
min = right - left + 1;
res = s.slice(left, right + 1);
}
--window[cur];
++left;
}
++right;
}
return res;
};