Skip to content

feat: add solutions to lc problem: No.3003 #2202

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
Jan 9, 2024
Merged

feat: add solutions to lc problem: No.3003 #2202

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
176 changes: 173 additions & 3 deletions ...ion/3000-3099/3003.Maximize the Number of Partitions After Operations/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -90,27 +90,197 @@ s 变为 "xayz"。
<!-- 这里可写当前语言的特殊实现逻辑 -->

```python

class Solution:
def maxPartitionsAfterOperations(self, s: str, k: int) -> int:
@cache
def dfs(i: int, cur: int, t: int) -> int:
if i >= n:
return 1
v = 1 << (ord(s[i]) - ord("a"))
nxt = cur | v
if nxt.bit_count() > k:
ans = dfs(i + 1, v, t) + 1
else:
ans = dfs(i + 1, nxt, t)
if t:
for j in range(26):
nxt = cur | (1 << j)
if nxt.bit_count() > k:
ans = max(ans, dfs(i + 1, 1 << j, 0) + 1)
else:
ans = max(ans, dfs(i + 1, nxt, 0))
return ans

n = len(s)
return dfs(0, 0, 1)
```

### **Java**

<!-- 这里可写当前语言的特殊实现逻辑 -->

```java

class Solution {
private Map<List<Integer>, Integer> f = new HashMap<>();
private String s;
private int k;

public int maxPartitionsAfterOperations(String s, int k) {
this.s = s;
this.k = k;
return dfs(0, 0, 1);
}

private int dfs(int i, int cur, int t) {
if (i >= s.length()) {
return 1;
}
var key = List.of(i, cur, t);
if (f.containsKey(key)) {
return f.get(key);
}
int v = 1 << (s.charAt(i) - 'a');
int nxt = cur | v;
int ans = Integer.bitCount(nxt) > k ? dfs(i + 1, v, t) + 1 : dfs(i + 1, nxt, t);
if (t > 0) {
for (int j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (Integer.bitCount(nxt) > k) {
ans = Math.max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = Math.max(ans, dfs(i + 1, nxt, 0));
}
}
}
f.put(key, ans);
return ans;
}
}
```

### **C++**

```cpp

class Solution {
public:
int maxPartitionsAfterOperations(string s, int k) {
int n = s.size();
unordered_map<long long, int> f;
function<int(int, int, int)> dfs = [&](int i, int cur, int t) {
if (i >= n) {
return 1;
}
long long key = (long long) i << 32 | cur << 1 | t;
if (f.count(key)) {
return f[key];
}
int v = 1 << (s[i] - 'a');
int nxt = cur | v;
int ans = __builtin_popcount(nxt) > k ? dfs(i + 1, v, t) + 1 : dfs(i + 1, nxt, t);
if (t) {
for (int j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (__builtin_popcount(nxt) > k) {
ans = max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = max(ans, dfs(i + 1, nxt, 0));
}
}
}
return f[key] = ans;
};
return dfs(0, 0, 1);
}
};
```

### **Go**

```go
func maxPartitionsAfterOperations(s string, k int) int {
n := len(s)
type tuple struct{ i, cur, t int }
f := map[tuple]int{}
var dfs func(i, cur, t int) int
dfs = func(i, cur, t int) int {
if i >= n {
return 1
}
key := tuple{i, cur, t}
if v, ok := f[key]; ok {
return v
}
v := 1 << (s[i] - 'a')
nxt := cur | v
var ans int
if bits.OnesCount(uint(nxt)) > k {
ans = dfs(i+1, v, t) + 1
} else {
ans = dfs(i+1, nxt, t)
}
if t > 0 {
for j := 0; j < 26; j++ {
nxt = cur | (1 << j)
if bits.OnesCount(uint(nxt)) > k {
ans = max(ans, dfs(i+1, 1<<j, 0)+1)
} else {
ans = max(ans, dfs(i+1, nxt, 0))
}
}
}
f[key] = ans
return ans
}
return dfs(0, 0, 1)
}
```

### **TypeScript**

```ts
function maxPartitionsAfterOperations(s: string, k: number): number {
const n = s.length;
const f: Map<bigint, number> = new Map();
const dfs = (i: number, cur: number, t: number): number => {
if (i >= n) {
return 1;
}
const key = (BigInt(i) << 27n) | (BigInt(cur) << 1n) | BigInt(t);
if (f.has(key)) {
return f.get(key)!;
}
const v = 1 << (s.charCodeAt(i) - 97);
let nxt = cur | v;
let ans = 0;
if (bitCount(nxt) > k) {
ans = dfs(i + 1, v, t) + 1;
} else {
ans = dfs(i + 1, nxt, t);
}
if (t) {
for (let j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (bitCount(nxt) > k) {
ans = Math.max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = Math.max(ans, dfs(i + 1, nxt, 0));
}
}
}
f.set(key, ans);
return ans;
};
return dfs(0, 0, 1);
}

function bitCount(i: number): number {
i = i - ((i >>> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
i = (i + (i >>> 4)) & 0x0f0f0f0f;
i = i + (i >>> 8);
i = i + (i >>> 16);
return i & 0x3f;
}
```

### **...**
Expand Down
176 changes: 173 additions & 3 deletions .../3000-3099/3003.Maximize the Number of Partitions After Operations/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -83,25 +83,195 @@ It can be shown that it is not possible to obtain more than 4 partitions.
### **Python3**

```python

class Solution:
def maxPartitionsAfterOperations(self, s: str, k: int) -> int:
@cache
def dfs(i: int, cur: int, t: int) -> int:
if i >= n:
return 1
v = 1 << (ord(s[i]) - ord("a"))
nxt = cur | v
if nxt.bit_count() > k:
ans = dfs(i + 1, v, t) + 1
else:
ans = dfs(i + 1, nxt, t)
if t:
for j in range(26):
nxt = cur | (1 << j)
if nxt.bit_count() > k:
ans = max(ans, dfs(i + 1, 1 << j, 0) + 1)
else:
ans = max(ans, dfs(i + 1, nxt, 0))
return ans

n = len(s)
return dfs(0, 0, 1)
```

### **Java**

```java

class Solution {
private Map<List<Integer>, Integer> f = new HashMap<>();
private String s;
private int k;

public int maxPartitionsAfterOperations(String s, int k) {
this.s = s;
this.k = k;
return dfs(0, 0, 1);
}

private int dfs(int i, int cur, int t) {
if (i >= s.length()) {
return 1;
}
var key = List.of(i, cur, t);
if (f.containsKey(key)) {
return f.get(key);
}
int v = 1 << (s.charAt(i) - 'a');
int nxt = cur | v;
int ans = Integer.bitCount(nxt) > k ? dfs(i + 1, v, t) + 1 : dfs(i + 1, nxt, t);
if (t > 0) {
for (int j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (Integer.bitCount(nxt) > k) {
ans = Math.max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = Math.max(ans, dfs(i + 1, nxt, 0));
}
}
}
f.put(key, ans);
return ans;
}
}
```

### **C++**

```cpp

class Solution {
public:
int maxPartitionsAfterOperations(string s, int k) {
int n = s.size();
unordered_map<long long, int> f;
function<int(int, int, int)> dfs = [&](int i, int cur, int t) {
if (i >= n) {
return 1;
}
long long key = (long long) i << 32 | cur << 1 | t;
if (f.count(key)) {
return f[key];
}
int v = 1 << (s[i] - 'a');
int nxt = cur | v;
int ans = __builtin_popcount(nxt) > k ? dfs(i + 1, v, t) + 1 : dfs(i + 1, nxt, t);
if (t) {
for (int j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (__builtin_popcount(nxt) > k) {
ans = max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = max(ans, dfs(i + 1, nxt, 0));
}
}
}
return f[key] = ans;
};
return dfs(0, 0, 1);
}
};
```

### **Go**

```go
func maxPartitionsAfterOperations(s string, k int) int {
n := len(s)
type tuple struct{ i, cur, t int }
f := map[tuple]int{}
var dfs func(i, cur, t int) int
dfs = func(i, cur, t int) int {
if i >= n {
return 1
}
key := tuple{i, cur, t}
if v, ok := f[key]; ok {
return v
}
v := 1 << (s[i] - 'a')
nxt := cur | v
var ans int
if bits.OnesCount(uint(nxt)) > k {
ans = dfs(i+1, v, t) + 1
} else {
ans = dfs(i+1, nxt, t)
}
if t > 0 {
for j := 0; j < 26; j++ {
nxt = cur | (1 << j)
if bits.OnesCount(uint(nxt)) > k {
ans = max(ans, dfs(i+1, 1<<j, 0)+1)
} else {
ans = max(ans, dfs(i+1, nxt, 0))
}
}
}
f[key] = ans
return ans
}
return dfs(0, 0, 1)
}
```

### **TypeScript**

```ts
function maxPartitionsAfterOperations(s: string, k: number): number {
const n = s.length;
const f: Map<bigint, number> = new Map();
const dfs = (i: number, cur: number, t: number): number => {
if (i >= n) {
return 1;
}
const key = (BigInt(i) << 27n) | (BigInt(cur) << 1n) | BigInt(t);
if (f.has(key)) {
return f.get(key)!;
}
const v = 1 << (s.charCodeAt(i) - 97);
let nxt = cur | v;
let ans = 0;
if (bitCount(nxt) > k) {
ans = dfs(i + 1, v, t) + 1;
} else {
ans = dfs(i + 1, nxt, t);
}
if (t) {
for (let j = 0; j < 26; ++j) {
nxt = cur | (1 << j);
if (bitCount(nxt) > k) {
ans = Math.max(ans, dfs(i + 1, 1 << j, 0) + 1);
} else {
ans = Math.max(ans, dfs(i + 1, nxt, 0));
}
}
}
f.set(key, ans);
return ans;
};
return dfs(0, 0, 1);
}

function bitCount(i: number): number {
i = i - ((i >>> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
i = (i + (i >>> 4)) & 0x0f0f0f0f;
i = i + (i >>> 8);
i = i + (i >>> 16);
return i & 0x3f;
}
```

### **...**
Expand Down
Loading