Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Snowleopard_wu
Java
提交
25b3ff47
J
Java
项目概览
Snowleopard_wu
/
Java
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
J
Java
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
25b3ff47
编写于
10月 27, 2020
作者:
ishellhub
提交者:
GitHub
10月 27, 2020
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #1964 from TheAlgorithms/infix2posfix
Infix2posfix
上级
2e6c7b4c
6015137b
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
57 addition
and
0 deletion
+57
-0
.github/workflows/checkstyle.yml
.github/workflows/checkstyle.yml
+1
-0
DIRECTORY.md
DIRECTORY.md
+1
-0
DataStructures/Stacks/InfixToPostfix.java
DataStructures/Stacks/InfixToPostfix.java
+55
-0
未找到文件。
.github/workflows/checkstyle.yml
浏览文件 @
25b3ff47
...
@@ -20,6 +20,7 @@ jobs:
...
@@ -20,6 +20,7 @@ jobs:
-
name
:
Commit Format changes
-
name
:
Commit Format changes
if
:
failure()
if
:
failure()
run
:
|
run
:
|
git diff
git config --global user.name github-actions
git config --global user.name github-actions
git config --global user.email '${GITHUB_ACTOR}@users.noreply.github.com'
git config --global user.email '${GITHUB_ACTOR}@users.noreply.github.com'
git remote set-url origin https://x-access-token:${{ secrets.GITHUB_TOKEN }}@github.com/$GITHUB_REPOSITORY
git remote set-url origin https://x-access-token:${{ secrets.GITHUB_TOKEN }}@github.com/$GITHUB_REPOSITORY
...
...
DIRECTORY.md
浏览文件 @
25b3ff47
...
@@ -75,6 +75,7 @@
...
@@ -75,6 +75,7 @@
*
Stacks
*
Stacks
*
[
BalancedBrackets
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/BalancedBrackets.java
)
*
[
BalancedBrackets
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/BalancedBrackets.java
)
*
[
DecimalToAnyUsingStack
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/DecimalToAnyUsingStack.java
)
*
[
DecimalToAnyUsingStack
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/DecimalToAnyUsingStack.java
)
*
[
InfixToPostfix
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/InfixToPostfix.java
)
*
[
NodeStack
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/NodeStack.java
)
*
[
NodeStack
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/NodeStack.java
)
*
[
StackArray
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/StackArray.java
)
*
[
StackArray
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/StackArray.java
)
*
[
StackArrayList
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/StackArrayList.java
)
*
[
StackArrayList
](
https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Stacks/StackArrayList.java
)
...
...
DataStructures/Stacks/InfixToPostfix.java
0 → 100644
浏览文件 @
25b3ff47
package
DataStructures.Stacks
;
import
java.util.Stack
;
public
class
InfixToPostfix
{
public
static
void
main
(
String
[]
args
)
throws
Exception
{
assert
"32+"
.
equals
(
infix2PostFix
(
"3+2"
));
assert
"123++"
.
equals
(
infix2PostFix
(
"1+(2+3)"
));
assert
"34+5*6-"
.
equals
(
infix2PostFix
(
"(3+4)*5-6"
));
}
public
static
String
infix2PostFix
(
String
infixExpression
)
throws
Exception
{
if
(!
BalancedBrackets
.
isBalanced
(
infixExpression
))
{
throw
new
Exception
(
"invalid expression"
);
}
StringBuilder
output
=
new
StringBuilder
();
Stack
<
Character
>
stack
=
new
Stack
<>();
for
(
char
element
:
infixExpression
.
toCharArray
())
{
if
(
Character
.
isLetterOrDigit
(
element
))
{
output
.
append
(
element
);
}
else
if
(
element
==
'('
)
{
stack
.
push
(
element
);
}
else
if
(
element
==
')'
)
{
while
(!
stack
.
isEmpty
()
&&
stack
.
peek
()
!=
'('
)
{
output
.
append
(
stack
.
pop
());
}
stack
.
pop
();
}
else
{
while
(!
stack
.
isEmpty
()
&&
precedence
(
element
)
<=
precedence
(
stack
.
peek
()))
{
output
.
append
(
stack
.
pop
());
}
stack
.
push
(
element
);
}
}
while
(!
stack
.
isEmpty
())
{
output
.
append
(
stack
.
pop
());
}
return
output
.
toString
();
}
private
static
int
precedence
(
char
operator
)
{
switch
(
operator
)
{
case
'+'
:
case
'-'
:
return
0
;
case
'*'
:
case
'/'
:
return
1
;
case
'^'
:
return
2
;
default
:
return
-
1
;
}
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录