Using a Linked List structure, determine whether a linked list contains a Palindrome in integers. For example, the following is a Palindrome:
0-> 1 -> 2 -> 1 -> 0
To solve this problem, following these steps:
1.) reverse the linked list
2.) compare the reversed list to the original list
3.) if they're the same, you have a Palindrome.
Create the following methods in a helper class. From the tester/driver class, call isPalindrome(aLL) from main.
Create the linked list by hard coding values in the linked list. For example:
LinkedList goodTest = new LinkedList();
goodTest.addLast("0");
goodTest.addLast("1");
goodTest.addLast("2");
goodTest.addLast("1");
goodTest.addLast("0")
boolean isPalindrome(LinkedList aLL) ~ given a linked list, will return whether the linked list is a Palindrome.
LinkedList reverseAndClone(LinkedList aLL) ~ given a linked list, will return the reversed linked list.
boolean isEqual(LinkedList one, LinkedList two) ~ given the 2 linked lists, will return whether they are both the same.
To test the program, in main method:
1. create a linked list that is a Palindrome, and call the isPalindrome method, passing it a linkedList. Test to ensure it returns True.
2. create a linked list that is NOT a Palindrome, and call the isPalindrome method passing it a linkedList. Test to ensure it returns a False.