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 e348823

Browse files
Merge pull request #2802 from Kristy-an/master
fix python block code highlight problem
2 parents ce09572 + 492f45f commit e348823

File tree

3 files changed

+4
-3
lines changed

3 files changed

+4
-3
lines changed

‎problems/0503.下一个更大元素II.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -185,7 +185,7 @@ class Solution:
185185
186186
> 版本二:针对版本一的优化
187187
188-
```python3
188+
```python
189189
class Solution:
190190
def nextGreaterElements(self, nums: List[int]) -> List[int]:
191191
res = [-1] * len(nums)

‎problems/kamacoder/0099.岛屿的数量广搜.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -254,6 +254,7 @@ directions = [[0, 1], [1, 0], [0, -1], [-1, 0]]
254254
def bfs(grid, visited, x, y):
255255
que = deque([])
256256
que.append([x,y])
257+
visited[x][y] = True
257258
while que:
258259
cur_x, cur_y = que.popleft()
259260
for i, j in directions:

‎problems/kamacoder/0101.孤岛的总面积.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -261,10 +261,10 @@ public class Main {
261261
from collections import deque
262262

263263
# 处理输入
264-
n, m = list(map(int, input().strip()))
264+
n, m = list(map(int, input().split()))
265265
g = []
266266
for _ in range(n):
267-
row = list(map(int, input().strip()))
267+
row = list(map(int, input().split()))
268268
g.append(row)
269269

270270
# 定义四个方向、孤岛面积(遍历完边缘后会被重置)

0 commit comments

Comments
(0)

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