-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathLinkedListExample.cpp
More file actions
134 lines (106 loc) · 2.06 KB
/
LinkedListExample.cpp
File metadata and controls
134 lines (106 loc) · 2.06 KB
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <stdio.h>
#include <iostream>
#include <vector>
struct Node
{
int data;
struct Node* next;
};
struct Node* first = NULL;
struct Node* last = NULL;
void create(int A[], int n)
{
if(first)
return;
Node* t = (struct Node*)malloc(sizeof(struct Node));
first = t;
t->data = A[0];
t->next = NULL;
last = first;
for(int i = 1; i < n; i++)
{
t = (struct Node*)malloc(sizeof(struct Node));
t->data = A[i];
t->next = NULL;
last->next = t;
last = t;
}
}
void print()
{
if(first == NULL)
return;
struct Node* p;
p = first;
while(p)
{
std::cout<<p->data<<" ";
p = p->next;
}
}
void pushLast(int value)
{
if(last == NULL)
return;
Node* t = (struct Node*)malloc(sizeof(struct Node));
t->data = value;
t->next = NULL;
last->next = t;
last = t;
}
void pushFirst(int value)
{
if(first == NULL)
return;
Node* t = (struct Node*)malloc(sizeof(struct Node));
t->data = value;
t->next = first;
first = t;
}
void findPalindrome(std::vector<int> &vec)
{
if(first == NULL)
return;
struct Node* p;
p = first;
int n,d,s;
while(p)
{
n = p->data;
d = 0;
s = 0;
while(n > 0)
{
d = n % 10;
s = s*10 + d;
n = n / 10;
}
if(s == p->data)
vec.push_back(p->data);
p = p->next;
}
}
int main(int argc, char **argv)
{
int A[] = {11,223,323,414,52};
int n ; // sizeof(A)/sizeof(A[0]);
n = sizeof(A)/sizeof(A[0]);
pushLast(12);
print();
pushFirst(12);
print();
create(A,n);
print();
std::cout<<std::endl;
pushLast(34);
print();
std::cout<<std::endl;
pushFirst(1881);
print();
std::cout<<std::endl<<"palindrome numbers ";
std::vector<int> vec;
findPalindrome(vec);
for(auto s : vec)
std::cout<<s<<" ";
return 0;
}