Movatterモバイル変換


[0]ホーム

URL:


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

Commit748742c

Browse files
authored
Update solution to exactly match that shown in video
Fixesneetcode-gh#1015
1 parent55ddbe9 commit748742c

File tree

1 file changed

+18
-15
lines changed

1 file changed

+18
-15
lines changed

‎python/239-Sliding-Window-Maximum.py

Lines changed: 18 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,22 @@
11
classSolution:
22
defmaxSlidingWindow(self,nums:List[int],k:int)->List[int]:
3-
indexQ=deque()
4-
valQ=deque()
3+
output= []
4+
q=collections.deque()# index
5+
l=r=0
6+
# O(n) O(n)
7+
whilel<len(nums):
8+
# pop smaller values from q
9+
whileqandnums[q[-1]]<nums[r]:
10+
q.pop()
11+
q.append(r)
512

6-
res= []
7-
fori,ninenumerate(nums):
8-
whilevalQandn>valQ[-1]:
9-
valQ.pop()
10-
indexQ.pop()
11-
valQ.append(n)
12-
indexQ.append(i)
13+
# remove left val from window
14+
ifl>q[0]:
15+
q.popleft()
1316

14-
whilei-indexQ[0]+1>k:
15-
valQ.popleft()
16-
indexQ.popleft()
17-
ifi+1>=k:
18-
res.append(valQ[0])
19-
returnres
17+
if (r+1)>=k:
18+
output.append(nums[q[0]])
19+
l+=1
20+
r+=1
21+
22+
returnoutput

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp