-
Notifications
You must be signed in to change notification settings - Fork 0
/
revLL.cpp
83 lines (72 loc) · 1.52 KB
/
revLL.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
#include <iostream>
#include <vector>
struct node {
int data;
struct node * next;
};
void reverse(struct node* & head)
{
struct node * prev, * curr, * next;
prev = NULL;
curr = head;
while(curr != NULL)
{
next = curr->next;
curr->next = prev;
prev = curr;
curr = next;
}
head = prev;
}
void createLinkedList(std::vector<int> & arr, struct node &head)
{
int N = arr.size();
int i = 0;
struct node *current = &head;
while( i < N ) {
current->data = arr[i];
if(i < N-1)
{
current->next = new struct node;
current = current->next;
}
else
{
current->next = NULL;
}
++i;
}
current = NULL;
delete current;
return;
/*for(int i = 0; i < arr.size(); i++)
{
struct node * current = new struct node;
current->data = arr[arr.size()-i-1];
current->next = head;
head = current;
}*/
}
void displayList(struct node * head)
{
struct node * temp;
temp = head;
while(temp->next != NULL)
{
std::cout<<temp->data<<std::endl;
temp = temp->next;
}
std::cout<<temp->data<<std::endl;
}
int main()
{
int arr[] = {3, 4, 5, 6, 7};
std::vector<int> array(arr, arr+sizeof(arr)/sizeof(int));
struct node * head = new struct node;
createLinkedList(array, *head);
displayList(head);
reverse(head);
std::cout<<"here"<<std::endl;
displayList(head);
return 0;
}