Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
武汉红喜
whatsmars
提交
b6507b6e
W
whatsmars
项目概览
武汉红喜
/
whatsmars
通知
3
Star
0
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
W
whatsmars
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
b6507b6e
编写于
8月 12, 2019
作者:
武汉红喜
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
collections
上级
7c60e953
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
130 addition
and
0 deletion
+130
-0
whatsmars-common/src/test/java/org/hongxi/java/util/collections/ListReverseTest.java
...ava/org/hongxi/java/util/collections/ListReverseTest.java
+17
-0
whatsmars-common/src/test/java/org/hongxi/java/util/collections/SimpleList.java
...est/java/org/hongxi/java/util/collections/SimpleList.java
+59
-0
whatsmars-common/src/test/java/org/hongxi/java/util/collections/SimpleStack.java
...st/java/org/hongxi/java/util/collections/SimpleStack.java
+37
-0
whatsmars-common/src/test/java/org/hongxi/java/util/collections/StackTest.java
...test/java/org/hongxi/java/util/collections/StackTest.java
+17
-0
未找到文件。
whatsmars-common/src/test/java/org/hongxi/java/util/collections/ListReverseTest.java
0 → 100644
浏览文件 @
b6507b6e
package
org.hongxi.java.util.collections
;
/**
* @author shenhongxi 2019/8/12
*/
public
class
ListReverseTest
{
public
static
void
main
(
String
[]
args
)
{
SimpleList
<
Integer
>
list
=
new
SimpleList
<>();
list
.
add
(
1
);
list
.
add
(
2
);
list
.
add
(
3
);
System
.
out
.
println
(
list
);
list
.
reverse
();
System
.
out
.
println
(
list
);
}
}
whatsmars-common/src/test/java/org/hongxi/java/util/collections/SimpleList.java
0 → 100644
浏览文件 @
b6507b6e
package
org.hongxi.java.util.collections
;
/**
* @author shenhongxi 2019/8/12
*
* @see java.util.LinkedList
*/
public
class
SimpleList
<
E
>
{
int
size
;
Node
<
E
>
first
;
Node
<
E
>
last
;
void
add
(
E
e
)
{
final
Node
<
E
>
l
=
last
;
final
Node
<
E
>
newNode
=
new
Node
<>(
e
,
null
);
last
=
newNode
;
if
(
l
==
null
)
first
=
newNode
;
else
l
.
next
=
newNode
;
size
++;
}
void
reverse
()
{
if
(
first
==
null
)
return
;
last
=
first
;
Node
<
E
>
pre
=
first
;
Node
<
E
>
curr
=
pre
.
next
;
while
(
curr
!=
null
)
{
pre
.
next
=
curr
.
next
;
curr
.
next
=
first
;
first
=
curr
;
curr
=
pre
.
next
;
}
}
static
class
Node
<
E
>
{
E
item
;
Node
<
E
>
next
;
Node
(
E
item
,
Node
<
E
>
next
)
{
this
.
item
=
item
;
this
.
next
=
next
;
}
}
@Override
public
String
toString
()
{
StringBuilder
s
=
new
StringBuilder
();
for
(
Node
<
E
>
p
=
first
;
p
!=
null
;
p
=
p
.
next
)
{
s
.
append
(
p
.
item
);
if
(
p
!=
last
)
{
s
.
append
(
", "
);
}
}
return
"["
+
s
.
toString
()
+
"]"
;
}
}
whatsmars-common/src/test/java/org/hongxi/java/util/collections/SimpleStack.java
0 → 100644
浏览文件 @
b6507b6e
package
org.hongxi.java.util.collections
;
import
java.util.ArrayList
;
import
java.util.EmptyStackException
;
import
java.util.List
;
/**
* @author shenhongxi 2019/8/12
*
* @see java.util.Stack
*/
public
class
SimpleStack
<
E
>
{
private
int
size
;
private
List
<
E
>
elements
=
new
ArrayList
<>();
public
void
push
(
E
ele
)
{
if
(
elements
.
size
()
>
size
)
{
elements
.
set
(
size
,
ele
);
}
else
{
elements
.
add
(
ele
);
}
size
++;
}
public
E
pop
()
{
if
(
size
==
0
)
{
throw
new
EmptyStackException
();
}
return
elements
.
set
(--
size
,
null
);
}
public
int
size
()
{
return
size
;
}
}
whatsmars-common/src/test/java/org/hongxi/java/util/collections/StackTest.java
0 → 100644
浏览文件 @
b6507b6e
package
org.hongxi.java.util.collections
;
/**
* @author shenhongxi 2019/8/12
*/
public
class
StackTest
{
public
static
void
main
(
String
[]
args
)
{
SimpleStack
<
Integer
>
stack
=
new
SimpleStack
<>();
stack
.
push
(
1
);
stack
.
push
(
2
);
stack
.
push
(
3
);
System
.
out
.
println
(
stack
.
pop
());
System
.
out
.
println
(
stack
.
pop
());
System
.
out
.
println
(
stack
.
pop
());
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录