Skip to content

Commit 4b72615

Browse files
authored
Merge pull request #3 from LeetcodeRush/master
master to main
2 parents 7db4c63 + ff52ff1 commit 4b72615

File tree

2 files changed

+40
-0
lines changed
  • Problems
    • 28-Egg-Drop-With-2-Eggs-and-N-Floors
    • 29-Number-of-Good-Ways-to-Split-a-String

2 files changed

+40
-0
lines changed
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
function twoEggDrop(n: number): number {
2+
3+
let dp : number[][] = Array.from(Array(3), () => new Array(n+1))
4+
5+
dp[1][0] = 0;
6+
dp[2][0] = 0;
7+
8+
for(let i = 1; i <= n; i++) {
9+
dp[1][i] = i;
10+
}
11+
12+
for(let i = 1; i <= n; i++) {
13+
for(let j = 1; j <= i; j++) {
14+
dp[2][i] = dp[2][i]!==undefined? Math.min(dp[2][i], 1+Math.max(dp[1][j-1],dp[2][i-j])) : 1+Math.max(dp[1][j-1],dp[2][i-j])
15+
}
16+
}
17+
18+
return dp[2][n];
19+
20+
21+
};
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
function numSplits(s: string): number {
2+
const left_set = new Set();
3+
const right_set = new Set();
4+
let arr = [];
5+
let res = 0;
6+
7+
for(let i=0; i<s.length; i++) {
8+
left_set.add(s[i]);
9+
arr[i] = left_set.size
10+
}
11+
for(let i=s.length-1; i>=0; i--) {
12+
right_set.add(s[i]);
13+
if(right_set.size === arr[i-1]){
14+
res++
15+
}
16+
}
17+
return res;
18+
19+
};

0 commit comments

Comments
 (0)