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

Commit 47e8c88

Browse files
committed
feat: rename Problem No.1576
1 parent 3488d68 commit 47e8c88

File tree

9 files changed

+6
-6
lines changed

9 files changed

+6
-6
lines changed
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# [1576. 替换所有的问号](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters)
22

3-
[English Version](/solution/1500-1599/1576.Replace%20All%20%23003F's%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md)
3+
[English Version](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md)
44

55
## 题目描述
66

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# [1576. Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters)
22

3-
[中文文档](/solution/1500-1599/1576.Replace%20All%20%23003F's%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
3+
[中文文档](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
44

55
## Description
66

File renamed without changes.
File renamed without changes.
File renamed without changes.

‎solution/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1586,7 +1586,7 @@
15861586
| [1573](https://leetcode-cn.com/problems/number-of-ways-to-split-a-string) | [分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) | `字符串` | 中等 | |
15871587
| [1574](https://leetcode-cn.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted) | [删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) | `数组`,`二分查找` | 中等 | |
15881588
| [1575](https://leetcode-cn.com/problems/count-all-possible-routes) | [统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) | `动态规划` | 困难 | |
1589-
| [1576](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters) | [替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%3F%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) | `字符串` | 简单 | |
1589+
| [1576](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters) | [替换所有的问号](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) | `字符串` | 简单 | |
15901590
| [1577](https://leetcode-cn.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) | [数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) | `哈希表`,`数学` | 中等 | |
15911591
| [1578](https://leetcode-cn.com/problems/minimum-deletion-cost-to-avoid-repeating-letters) | [避免重复字母的最小删除成本](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README.md) | `贪心算法` | 中等 | |
15921592
| [1579](https://leetcode-cn.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable) | [保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) | `并查集` | 困难 | |

‎solution/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1585,7 +1585,7 @@ Press <kbd>Control</kbd>+<kbd>F</kbd>(or <kbd>Command</kbd>+<kbd>F</kbd> on the
15851585
| [1573](https://leetcode.com/problems/number-of-ways-to-split-a-string) | [Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) | `String` | Medium | |
15861586
| [1574](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted) | [Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) | `Array`,`Binary Search` | Medium | |
15871587
| [1575](https://leetcode.com/problems/count-all-possible-routes) | [Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) | `Dynamic Programming` | Hard | |
1588-
| [1576](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters) | [Replace All ?'s to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%3F%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) | `String` | Easy | |
1588+
| [1576](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters) | [Replace All ?'s to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) | `String` | Easy | |
15891589
| [1577](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) | [Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) | `Hash Table`,`Math` | Medium | |
15901590
| [1578](https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters) | [Minimum Deletion Cost to Avoid Repeating Letters](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README_EN.md) | `Greedy` | Medium | |
15911591
| [1579](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable) | [Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) | `Union Find` | Hard | |

‎solution/summary.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1627,7 +1627,7 @@
16271627
* [1573.Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
16281628
* [1574.Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)
16291629
* [1575.Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)
1630-
* [1576.Replace All #003F's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%23003F%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
1630+
* [1576.Replace All #003F's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
16311631
* [1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md)
16321632
* [1578.Minimum Deletion Cost to Avoid Repeating Letters](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README.md)
16331633
* [1579.Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md)

‎solution/summary_en.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1627,7 +1627,7 @@
16271627
* [1573.Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md)
16281628
* [1574.Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md)
16291629
* [1575.Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md)
1630-
* [1576.Replace All #003F's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%23003F%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md)
1630+
* [1576.Replace All #003F's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md)
16311631
* [1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md)
16321632
* [1578.Minimum Deletion Cost to Avoid Repeating Letters](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README_EN.md)
16331633
* [1579.Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md)

0 commit comments

Comments
(0)

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