FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/132-pattern.py at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
Python
/
132-pattern.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
21 lines (18 loc) · 463 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
132-pattern.py
Copy path
File metadata and controls
21 lines (18 loc) · 463 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
# Time: O(n)
# Space: O(n)
class
Solution
(
object
):
def
find132pattern
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: bool
"""
ak
=
float
(
"-inf"
)
st
=
[]
for
i
in
reversed
(
xrange
(
len
(
nums
))):
if
nums
[
i
]
<
ak
:
return
True
else
:
while
st
and
nums
[
i
]
>
st
[
-
1
]:
ak
=
st
.
pop
()
st
.
append
(
nums
[
i
])
return
False
Back
|
FazBrowse Home
|
New Git URL