palindrome-linked-list 1.0.0
Palindrome Linked List
Loading...
Searching...
No Matches
main.cpp File Reference
#include <iostream>
#include <deque>
Include dependency graph for main.cpp:

Go to the source code of this file.

Data Structures

struct  ListNode
 Definition for singly-linked list. More...
 
class  Solution
 

Functions

void delete_list (ListNode *ptr)
 
int main ()
 

Function Documentation

◆ delete_list()

void delete_list ( ListNode ptr)

Definition at line 51 of file main.cpp.

52{
53 ListNode* tmp = ptr->next;
54 if (tmp)
55 delete_list(tmp);
56 delete ptr;
57}
void delete_list(ListNode *ptr)
Definition main.cpp:51
Definition for singly-linked list.
Definition main.cpp:10
ListNode * next
Definition main.cpp:12

References delete_list(), and ListNode::next.

Referenced by delete_list(), and main().

◆ main()

int main ( )

Definition at line 59 of file main.cpp.

60{
61 ListNode* head = new ListNode(0, new ListNode(1, new ListNode(1, new ListNode(0, NULL))));
62 Solution sol;
63 bool result = sol.isPalindrome(head);
64 if (result)
65 cout << "The list is a palindrome" << endl;
66 else
67 cout << "The list is not a palindrome" << endl;
68 delete_list(head);
69 return 0;
70}
bool isPalindrome(ListNode *head)
Definition main.cpp:21

References delete_list(), and Solution::isPalindrome().