Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
zhhf96
C-Plus-Plus-TheAlgorithms
提交
7be0b8de
C
C-Plus-Plus-TheAlgorithms
项目概览
zhhf96
/
C-Plus-Plus-TheAlgorithms
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
C-Plus-Plus-TheAlgorithms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
7be0b8de
编写于
4月 22, 2020
作者:
M
Marian Gusatu
提交者:
GitHub
4月 22, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Update Linked List.cpp
fix: reverse check for empty list + cpplint coding style
上级
248c335b
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
23 addition
and
23 deletion
+23
-23
data_structure/Linked List.cpp
data_structure/Linked List.cpp
+23
-23
未找到文件。
data_structure/Linked List.cpp
浏览文件 @
7be0b8de
...
@@ -27,7 +27,7 @@ void insert(int x) {
...
@@ -27,7 +27,7 @@ void insert(int x) {
void
remove
(
int
x
)
{
void
remove
(
int
x
)
{
if
(
start
==
NULL
)
{
if
(
start
==
NULL
)
{
cout
<<
"
\n
Linked List is empty
\n
"
;
std
::
cout
<<
"
\n
Linked List is empty
\n
"
;
return
;
return
;
}
else
if
(
start
->
val
==
x
)
{
}
else
if
(
start
->
val
==
x
)
{
node
*
temp
=
start
;
node
*
temp
=
start
;
...
@@ -44,7 +44,7 @@ void remove(int x) {
...
@@ -44,7 +44,7 @@ void remove(int x) {
}
}
if
(
temp
==
NULL
)
{
if
(
temp
==
NULL
)
{
cout
<<
endl
<<
x
<<
" not found in list
\n
"
;
std
::
cout
<<
endl
<<
x
<<
" not found in list
\n
"
;
return
;
return
;
}
}
...
@@ -57,21 +57,21 @@ void search(int x) {
...
@@ -57,21 +57,21 @@ void search(int x) {
int
found
=
0
;
int
found
=
0
;
while
(
t
!=
NULL
)
{
while
(
t
!=
NULL
)
{
if
(
t
->
val
==
x
)
{
if
(
t
->
val
==
x
)
{
cout
<<
"
\n
Found"
;
std
::
cout
<<
"
\n
Found"
;
found
=
1
;
found
=
1
;
break
;
break
;
}
}
t
=
t
->
next
;
t
=
t
->
next
;
}
}
if
(
found
==
0
)
{
if
(
found
==
0
)
{
cout
<<
"
\n
Not Found"
;
std
::
cout
<<
"
\n
Not Found"
;
}
}
}
}
void
show
()
{
void
show
()
{
node
*
t
=
start
;
node
*
t
=
start
;
while
(
t
!=
NULL
)
{
while
(
t
!=
NULL
)
{
cout
<<
t
->
val
<<
"
\t
"
;
std
::
cout
<<
t
->
val
<<
"
\t
"
;
t
=
t
->
next
;
t
=
t
->
next
;
}
}
}
}
...
@@ -89,46 +89,46 @@ void reverse() {
...
@@ -89,46 +89,46 @@ void reverse() {
start
->
next
=
NULL
;
start
->
next
=
NULL
;
start
=
first
;
start
=
first
;
}
else
{
}
else
{
cout
<<
"
\n
Empty list"
;
std
::
cout
<<
"
\n
Empty list"
;
}
}
}
}
int
main
()
{
int
main
()
{
int
choice
,
x
;
int
choice
,
x
;
do
{
do
{
cout
<<
"
\n
1. Insert"
;
std
::
cout
<<
"
\n
1. Insert"
;
cout
<<
"
\n
2. Delete"
;
std
::
cout
<<
"
\n
2. Delete"
;
cout
<<
"
\n
3. Search"
;
std
::
cout
<<
"
\n
3. Search"
;
cout
<<
"
\n
4. Print"
;
std
::
cout
<<
"
\n
4. Print"
;
cout
<<
"
\n
5. Reverse"
;
std
::
cout
<<
"
\n
5. Reverse"
;
cout
<<
"
\n
0. Exit"
;
std
::
cout
<<
"
\n
0. Exit"
;
cout
<<
"
\n\n
Enter you choice : "
;
std
::
cout
<<
"
\n\n
Enter you choice : "
;
cin
>>
choice
;
std
::
cin
>>
choice
;
switch
(
choice
)
{
switch
(
choice
)
{
case
1
:
case
1
:
cout
<<
"
\n
Enter the element to be inserted : "
;
std
::
cout
<<
"
\n
Enter the element to be inserted : "
;
cin
>>
x
;
std
::
cin
>>
x
;
insert
(
x
);
insert
(
x
);
break
;
break
;
case
2
:
case
2
:
cout
<<
"
\n
Enter the element to be removed : "
;
std
::
cout
<<
"
\n
Enter the element to be removed : "
;
cin
>>
x
;
std
::
cin
>>
x
;
remove
(
x
);
remove
(
x
);
break
;
break
;
case
3
:
case
3
:
cout
<<
"
\n
Enter the element to be searched : "
;
std
::
cout
<<
"
\n
Enter the element to be searched : "
;
cin
>>
x
;
std
::
cin
>>
x
;
search
(
x
);
search
(
x
);
break
;
break
;
case
4
:
case
4
:
show
();
show
();
cout
<<
"
\n
"
;
std
::
cout
<<
"
\n
"
;
break
;
break
;
case
5
:
case
5
:
cout
<<
"The reversed list:
\n
"
;
std
::
cout
<<
"The reversed list:
\n
"
;
reverse
();
reverse
();
show
();
show
();
cout
<<
"
\n
"
;
std
::
cout
<<
"
\n
"
;
break
;
break
;
}
}
}
while
(
choice
!=
0
);
}
while
(
choice
!=
0
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录