-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.cpp
113 lines (87 loc) · 1.89 KB
/
list.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
//
// main.cpp
// list
//
// Created by sunpeiyang on 2016/11/20.
// Copyright © 2016年 sun. All rights reserved.
//
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
typedef struct Element
{
struct Element *next;
int data;
}Element;
bool insertFront(Element **head, int data)
{
Element *newElem = (Element*)malloc(sizeof(Element));
newElem->data = data;
newElem->next = *head;
*head = newElem;
return true;
}
bool insertEnd(Element* head, int data)
{
Element* tail = head;
while (tail->next)
tail = tail->next;
Element *newElem = (Element*)malloc(sizeof(Element));
newElem->data = data;
tail->next = newElem;
return true;
}
bool printList(Element* head)
{
while (head->next)
{
printf("%d\n", head->data);
head = head->next;
}
printf("%d\n", head->data);
return true;
}
bool deleteElement(Element** head, Element* deleteMe)
{
Element* elem;
if (!head || !*head || !deleteMe)
return false;
elem = *head;
if (deleteMe == *head)
{
*head = elem->next;
free(deleteMe);
return true;
}
while (elem->next == deleteMe)
{
elem->next = deleteMe->next;
free(deleteMe);
return true;
}
elem = elem->next;
return false;
}
void deleteList(Element** head)
{
Element* deleteMe = *head;
while (deleteMe)
{
Element* next = deleteMe->next;
free(deleteMe);
deleteMe = next;
}
return;
}
int main(int argc, const char * argv[]) {
// insert code here...
std::cout << "Hello, World!\n";
Element* head = (Element*)malloc (sizeof(Element));
head->data = 1;
//insertFront(&head, 2);
//insertFront(&head, 3);
insertEnd(head, 2);
insertEnd(head, 3);
printList(head);
return 0;
}