-
Notifications
You must be signed in to change notification settings - Fork 232
/
Copy pathcheckPallindrome.cpp
109 lines (90 loc) · 2.02 KB
/
checkPallindrome.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
{ Driver Code Starts
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <stack>
using namespace std;
/* Link list Node */
struct Node {
int data;
struct Node *next;
Node(int x) {
data = x;
next = NULL;
}
};
// } Driver Code Ends
class Solution{
public:
//Function to check whether the list is palindrome.
Node *rev(Node *head){
Node *prev=NULL;
Node *curr=head;
while(curr!=NULL){
Node* nextptr=curr->next;
curr->next=prev;
prev=curr;
curr=nextptr;
}
return prev;
}
bool isPalindrome(Node *head)
{
//Your code here
if(head==NULL or head->next==NULL){
return true;
}
Node *sp=head;
Node *sl=head;
while(sp!=NULL && sp->next!=NULL){
sl=sl->next;
sp=sp->next->next;
}
// sl->next=rev(sl->next);
Node *h1=head;
Node *h2;
if(sp!=NULL){
sl->next=rev(sl->next);
h2=sl->next;
}
else if(sp==NULL)
{
sl=rev(sl);
h2=sl;
}
while(h2!=NULL){
if(h1->data!=h2->data)
return false;
h1=h1->next;
h2=h2->next;
}
return true;
}
};
// { Driver Code Starts.
/* Driver program to test above function*/
int main()
{
int T,i,n,l,firstdata;
cin>>T;
while(T--)
{
struct Node *head = NULL, *tail = NULL;
cin>>n;
// taking first data of LL
cin>>firstdata;
head = new Node(firstdata);
tail = head;
// taking remaining data of LL
for(i=1;i<n;i++)
{
cin>>l;
tail->next = new Node(l);
tail = tail->next;
}
Solution obj;
cout<<obj.isPalindrome(head)<<endl;
}
return 0;
}
// } Driver Code Ends