Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
jinhua115315
Python
提交
c0ed031b
P
Python
项目概览
jinhua115315
/
Python
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
代码片段
项目成员
Pages
P
Python
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
代码片段
代码片段
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
c0ed031b
编写于
10月 26, 2021
作者:
E
Edward Nuno
提交者:
GitHub
10月 26, 2021
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix type annotations for stack.py (#5566)
上级
582f57f4
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
15 addition
and
11 deletion
+15
-11
data_structures/stacks/balanced_parentheses.py
data_structures/stacks/balanced_parentheses.py
+1
-1
data_structures/stacks/dijkstras_two_stack_algorithm.py
data_structures/stacks/dijkstras_two_stack_algorithm.py
+2
-2
data_structures/stacks/infix_to_postfix_conversion.py
data_structures/stacks/infix_to_postfix_conversion.py
+1
-1
data_structures/stacks/stack.py
data_structures/stacks/stack.py
+11
-7
未找到文件。
data_structures/stacks/balanced_parentheses.py
浏览文件 @
c0ed031b
...
...
@@ -14,7 +14,7 @@ def balanced_parentheses(parentheses: str) -> bool:
>>> balanced_parentheses("")
True
"""
stack
=
Stack
()
stack
:
Stack
[
str
]
=
Stack
()
bracket_pairs
=
{
"("
:
")"
,
"["
:
"]"
,
"{"
:
"}"
}
for
bracket
in
parentheses
:
if
bracket
in
bracket_pairs
:
...
...
data_structures/stacks/dijkstras_two_stack_algorithm.py
浏览文件 @
c0ed031b
...
...
@@ -51,8 +51,8 @@ def dijkstras_two_stack_algorithm(equation: str) -> int:
"""
operators
=
{
"*"
:
op
.
mul
,
"/"
:
op
.
truediv
,
"+"
:
op
.
add
,
"-"
:
op
.
sub
}
operand_stack
=
Stack
()
operator_stack
=
Stack
()
operand_stack
:
Stack
[
int
]
=
Stack
()
operator_stack
:
Stack
[
str
]
=
Stack
()
for
i
in
equation
:
if
i
.
isdigit
():
...
...
data_structures/stacks/infix_to_postfix_conversion.py
浏览文件 @
c0ed031b
...
...
@@ -38,7 +38,7 @@ def infix_to_postfix(expression_str: str) -> str:
"""
if
not
balanced_parentheses
(
expression_str
):
raise
ValueError
(
"Mismatched parentheses"
)
stack
=
Stack
()
stack
:
Stack
[
str
]
=
Stack
()
postfix
=
[]
for
char
in
expression_str
:
if
char
.
isalpha
()
or
char
.
isdigit
():
...
...
data_structures/stacks/stack.py
浏览文件 @
c0ed031b
from
__future__
import
annotations
from
typing
import
Generic
,
TypeVar
T
=
TypeVar
(
"T"
)
class
StackOverflowError
(
BaseException
):
pass
...
...
@@ -9,7 +13,7 @@ class StackUnderflowError(BaseException):
pass
class
Stack
:
class
Stack
(
Generic
[
T
])
:
"""A stack is an abstract data type that serves as a collection of
elements with two principal operations: push() and pop(). push() adds an
element to the top of the stack, and pop() removes an element from the top
...
...
@@ -19,7 +23,7 @@ class Stack:
"""
def
__init__
(
self
,
limit
:
int
=
10
):
self
.
stack
:
list
[
int
]
=
[]
self
.
stack
:
list
[
T
]
=
[]
self
.
limit
=
limit
def
__bool__
(
self
)
->
bool
:
...
...
@@ -28,13 +32,13 @@ class Stack:
def
__str__
(
self
)
->
str
:
return
str
(
self
.
stack
)
def
push
(
self
,
data
)
:
def
push
(
self
,
data
:
T
)
->
None
:
"""Push an element to the top of the stack."""
if
len
(
self
.
stack
)
>=
self
.
limit
:
raise
StackOverflowError
self
.
stack
.
append
(
data
)
def
pop
(
self
):
def
pop
(
self
)
->
T
:
"""
Pop an element off of the top of the stack.
...
...
@@ -47,7 +51,7 @@ class Stack:
raise
StackUnderflowError
return
self
.
stack
.
pop
()
def
peek
(
self
):
def
peek
(
self
)
->
T
:
"""
Peek at the top-most element of the stack.
...
...
@@ -71,7 +75,7 @@ class Stack:
"""Return the size of the stack."""
return
len
(
self
.
stack
)
def
__contains__
(
self
,
item
)
->
bool
:
def
__contains__
(
self
,
item
:
T
)
->
bool
:
"""Check if item is in stack"""
return
item
in
self
.
stack
...
...
@@ -80,7 +84,7 @@ def test_stack() -> None:
"""
>>> test_stack()
"""
stack
=
Stack
(
10
)
stack
:
Stack
[
int
]
=
Stack
(
10
)
assert
bool
(
stack
)
is
False
assert
stack
.
is_empty
()
is
True
assert
stack
.
is_full
()
is
False
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录