Skip to content

Commit

Permalink
feat: add solutions to lc problem: No.1208
Browse files Browse the repository at this point in the history 
No.1208.Get Equal Substrings Within Budget
  • Loading branch information
@yanglbme
yanglbme committed Dec 31, 2021
1 parent c4f62b9 commit 49a38f6
Show file tree
Hide file tree
Showing 16 changed files with 584 additions and 28 deletions.
130 changes: 129 additions & 1 deletion solution/1200-1299/1208.Get Equal Substrings Within Budget/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -55,22 +55,150 @@

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

前缀和 + 二分查找。

<!-- tabs:start -->

### **Python3**

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

```python

class Solution:
def equalSubstring(self, s: str, t: str, maxCost: int) -> int:
n = len(s)
presum = [0] * (n + 1)
for i in range(n):
presum[i + 1] = presum[i] + abs(ord(s[i]) - ord(t[i]))
left, right = 0, n

def check(l):
i = 0
while i + l - 1 < n:
j = i + l - 1
if presum[j + 1] - presum[i] <= maxCost:
return True
i += 1
return False

while left < right:
mid = (left + right + 1) >> 1
if check(mid):
left = mid
else:
right = mid - 1
return left
```

### **Java**

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

```java
class Solution {
public int equalSubstring(String s, String t, int maxCost) {
int n = s.length();
int[] presum = new int[n + 1];
for (int i = 0; i < n; ++i) {
presum[i + 1] = presum[i] + Math.abs(s.charAt(i) - t.charAt(i));
}
int left = 0, right = n;
while (left < right) {
int mid = (left + right + 1) >>> 1;
if (check(mid, presum, maxCost, n)) {
left = mid;
} else {
right = mid - 1;
}
}
return left;
}

private boolean check(int l, int[] s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n) {
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) {
return true;
}
++i;
}
return false;
}
}
```

### **C++**

```cpp
class Solution {
public:
int equalSubstring(string s, string t, int maxCost) {
int n = s.size();
vector<int> presum(n + 1);
for (int i = 0; i < n; ++i) presum[i + 1] = presum[i] + abs(s[i] - t[i]);
int left = 0, right = n;
while (left < right)
{
int mid = left + right + 1 >> 1;
if (check(mid, presum, maxCost, n)) left = mid;
else right = mid - 1;
}
return left;
}

bool check(int l, vector<int>& s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n)
{
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) return true;
++i;
}
return false;
}
};
```

### **Go**

```go
func equalSubstring(s string, t string, maxCost int) int {
n := len(s)
presum := make([]int, n+1)
for i, c := range s {
presum[i+1] = presum[i] + abs(int(c)-int(t[i]))
}

left, right := 0, n
check := func(l int) bool {
i := 0
for i+l-1 < n {
j := i + l - 1
if presum[j+1]-presum[i] <= maxCost {
return true
}
i++
}
return false
}
for left < right {
mid := (left + right + 1) >> 1
if check(mid) {
left = mid
} else {
right = mid - 1
}
}
return left
}

func abs(x int) int {
if x > 0 {
return x
}
return -x
}
```

### **...**
Expand Down
128 changes: 127 additions & 1 deletion solution/1200-1299/1208.Get Equal Substrings Within Budget/README_EN.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -52,13 +52,139 @@
### **Python3**

```python

class Solution:
def equalSubstring(self, s: str, t: str, maxCost: int) -> int:
n = len(s)
presum = [0] * (n + 1)
for i in range(n):
presum[i + 1] = presum[i] + abs(ord(s[i]) - ord(t[i]))
left, right = 0, n

def check(l):
i = 0
while i + l - 1 < n:
j = i + l - 1
if presum[j + 1] - presum[i] <= maxCost:
return True
i += 1
return False

while left < right:
mid = (left + right + 1) >> 1
if check(mid):
left = mid
else:
right = mid - 1
return left
```

### **Java**

```java
class Solution {
public int equalSubstring(String s, String t, int maxCost) {
int n = s.length();
int[] presum = new int[n + 1];
for (int i = 0; i < n; ++i) {
presum[i + 1] = presum[i] + Math.abs(s.charAt(i) - t.charAt(i));
}
int left = 0, right = n;
while (left < right) {
int mid = (left + right + 1) >>> 1;
if (check(mid, presum, maxCost, n)) {
left = mid;
} else {
right = mid - 1;
}
}
return left;
}

private boolean check(int l, int[] s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n) {
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) {
return true;
}
++i;
}
return false;
}
}
```

### **C++**

```cpp
class Solution {
public:
int equalSubstring(string s, string t, int maxCost) {
int n = s.size();
vector<int> presum(n + 1);
for (int i = 0; i < n; ++i) presum[i + 1] = presum[i] + abs(s[i] - t[i]);
int left = 0, right = n;
while (left < right)
{
int mid = left + right + 1 >> 1;
if (check(mid, presum, maxCost, n)) left = mid;
else right = mid - 1;
}
return left;
}

bool check(int l, vector<int>& s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n)
{
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) return true;
++i;
}
return false;
}
};
```

### **Go**

```go
func equalSubstring(s string, t string, maxCost int) int {
n := len(s)
presum := make([]int, n+1)
for i, c := range s {
presum[i+1] = presum[i] + abs(int(c)-int(t[i]))
}

left, right := 0, n
check := func(l int) bool {
i := 0
for i+l-1 < n {
j := i + l - 1
if presum[j+1]-presum[i] <= maxCost {
return true
}
i++
}
return false
}
for left < right {
mid := (left + right + 1) >> 1
if check(mid) {
left = mid
} else {
right = mid - 1
}
}
return left
}

func abs(x int) int {
if x > 0 {
return x
}
return -x
}
```

### **...**
Expand Down
27 changes: 27 additions & 0 deletions solution/1200-1299/1208.Get Equal Substrings Within Budget/Solution.cpp
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution {
public:
int equalSubstring(string s, string t, int maxCost) {
int n = s.size();
vector<int> presum(n + 1);
for (int i = 0; i < n; ++i) presum[i + 1] = presum[i] + abs(s[i] - t[i]);
int left = 0, right = n;
while (left < right)
{
int mid = left + right + 1 >> 1;
if (check(mid, presum, maxCost, n)) left = mid;
else right = mid - 1;
}
return left;
}

bool check(int l, vector<int>& s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n)
{
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) return true;
++i;
}
return false;
}
};
36 changes: 36 additions & 0 deletions solution/1200-1299/1208.Get Equal Substrings Within Budget/Solution.go
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
func equalSubstring(s string, t string, maxCost int) int {
n := len(s)
presum := make([]int, n+1)
for i, c := range s {
presum[i+1] = presum[i] + abs(int(c)-int(t[i]))
}

left, right := 0, n
check := func(l int) bool {
i := 0
for i+l-1 < n {
j := i + l - 1
if presum[j+1]-presum[i] <= maxCost {
return true
}
i++
}
return false
}
for left < right {
mid := (left + right + 1) >> 1
if check(mid) {
left = mid
} else {
right = mid - 1
}
}
return left
}

func abs(x int) int {
if x > 0 {
return x
}
return -x
}
31 changes: 31 additions & 0 deletions solution/1200-1299/1208.Get Equal Substrings Within Budget/Solution.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
class Solution {
public int equalSubstring(String s, String t, int maxCost) {
int n = s.length();
int[] presum = new int[n + 1];
for (int i = 0; i < n; ++i) {
presum[i + 1] = presum[i] + Math.abs(s.charAt(i) - t.charAt(i));
}
int left = 0, right = n;
while (left < right) {
int mid = (left + right + 1) >>> 1;
if (check(mid, presum, maxCost, n)) {
left = mid;
} else {
right = mid - 1;
}
}
return left;
}

private boolean check(int l, int[] s, int maxCost, int n) {
int i = 0;
while (i + l - 1 < n) {
int j = i + l - 1;
if (s[j + 1] - s[i] <= maxCost) {
return true;
}
++i;
}
return false;
}
}
Loading

0 comments on commit 49a38f6

Please sign in to comment.