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

feat: add ts solutions to lcp problems: No.11,12 #1756

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.

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
yanglbme merged 1 commit into main from dev
Oct 7, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
9 changes: 9 additions & 0 deletions lcp/LCP 11. 期望个数统计/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -111,6 +111,15 @@ func expectNumber(scores []int) int {
}
```

### **TypeScript**

```ts
function expectNumber(scores: number[]): number {
const s: Set<number> = new Set<number>(scores);
return s.size;
}
```

### **...**

```
Expand Down
4 changes: 4 additions & 0 deletions lcp/LCP 11. 期望个数统计/Solution.ts
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
function expectNumber(scores: number[]): number {
const s: Set<number> = new Set<number>(scores);
return s.size;
}
33 changes: 33 additions & 0 deletions lcp/LCP 12. 小张刷题计划/README.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -186,6 +186,39 @@ func max(a, b int) int {
}
```

### **TypeScript**

```ts
function minTime(time: number[], m: number): number {
let left = 0;
let right = time.reduce((a, b) => a + b);
const check = (t: number): boolean => {
let s = 0;
let mx = 0;
let d = 1;
for (const x of time) {
s += x;
mx = Math.max(mx, x);
if (s - mx > t) {
s = x;
mx = x;
d++;
}
}
return d <= m;
};
while (left < right) {
const mid = (left + right) >> 1;
if (check(mid)) {
right = mid;
} else {
left = mid + 1;
}
}
return left;
}
```

### **...**

```
Expand Down
28 changes: 28 additions & 0 deletions lcp/LCP 12. 小张刷题计划/Solution.ts
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
function minTime(time: number[], m: number): number {
let left = 0;
let right = time.reduce((a, b) => a + b);
const check = (t: number): boolean => {
let s = 0;
let mx = 0;
let d = 1;
for (const x of time) {
s += x;
mx = Math.max(mx, x);
if (s - mx > t) {
s = x;
mx = x;
d++;
}
}
return d <= m;
};
while (left < right) {
const mid = (left + right) >> 1;
if (check(mid)) {
right = mid;
} else {
left = mid + 1;
}
}
return left;
}

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