public void isNotPalindrome()
{
LinkedListNode first = new LinkedListNode('k');
LinkedListNode sec = new LinkedListNode('h');
LinkedListNode third = new LinkedListNode('o');
LinkedListNode forth = new LinkedListNode('l');
LinkedListNode fifth = new LinkedListNode('o');
LinkedListNode sixth = new LinkedListNode('o');
LinkedListNode seventh = new LinkedListNode('d', null, sixth);
first.setNext(sec);
first.setPrevious(null);
sec.setNext(third);
sec.setPrevious(first);
third.setNext(forth);
third.setPrevious(sec);
forth.setNext(fifth);
forth.setPrevious(third);
fifth.setNext(sixth);
fifth.setPrevious(forth);
sixth.setNext(seventh);
sixth.setPrevious(fifth);
seventh.setNext(null);
seventh.setPrevious(sixth);
Assert.AreEqual(false, palindromeLL.checkPalindrome(first, seventh));
}
public void isPalindrome()
{
// LinkedListNode sec = new LinkedListNode('o');
// LinkedListNode first = new LinkedListNode('t', sec, null);
// LinkedListNode third = new LinkedListNode('t', null, sec);
// sec.setPrevious(first);
LinkedListNode first = new LinkedListNode('t');
LinkedListNode sec = new LinkedListNode('o');
LinkedListNode third = new LinkedListNode('o');
LinkedListNode forth = new LinkedListNode('t');
first.setNext(sec);
first.setPrevious(null);
sec.setNext(third);
sec.setPrevious(first);
third.setNext(forth);
third.setPrevious(sec);
forth.setNext(null);
forth.setPrevious(third);
Assert.AreEqual(true, palindromeLL.checkPalindrome(first, forth));
}
public void SumOf2LinkedListsSameLength()
{
LinkedListNode sec = new LinkedListNode(1);
LinkedListNode first = new LinkedListNode(7, sec, null);
LinkedListNode third = new LinkedListNode(6, null, sec);
sec.setPrevious(first);
LinkedListNode sec1 = new LinkedListNode(9);
LinkedListNode first1 = new LinkedListNode(5, sec1, null);
LinkedListNode third1 = new LinkedListNode(2, null, sec1);
sec1.setPrevious(first1);
LinkedListNode result = SumList.sumList(first, first1, 0);
LinkedListNode sec2 = new LinkedListNode(1);
LinkedListNode first2 = new LinkedListNode(2, sec2, null);
LinkedListNode third2 = new LinkedListNode(9, null, sec2);
sec2.setPrevious(first2);
while (result != null && first2 != null)
{
Assert.AreEqual(result.data, first2.data);
System.Console.WriteLine(result.data);
result = result.next;
first2 = first2.next;
}
}
