[第二轮] 3/4-3/10 CareerCup 2.7

magict 同學忘記發帖的事了，這周我來發。
2.7
Implement a function to check if a linked list is a palindrome.


发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

https://gist.github.com/ThunderXu/5075796
calculate the size of the list, put the former half of the list into a stack and continue pop and compare while iterating the rest half

https://github.com/moophis/careercup/blob/master/2.2-7.cpp#L418
Push all value of nodes into a stack in order, then pop each value comparing with each node in the linked list.

1. If (size of LinkList) % 2 == 0,  return false
1. Separate the LinkList to two parts, the first half and the second half.
2. push the elements in second half to A stack.
3. pop the stack and compare each element with the first half. Until stack is empty.

https://gist.github.com/lazyGoose/5079309

moophis 发表于 2013-3-3 21:04
https://github.com/moophis/careercup/blob/master/2.2-7.cpp#L418
Push all value of nodes into a stac ...

Hi, 我刚学C语言，用array_to_list(arr, 5, head, tail); show_list(head, tail);的时候用不用加啥头文件？

java language
https://gist.github.com/mettaworld/5079404

lazyGoose 发表于 2013-3-4 09:44
Hi, 我刚学C语言，用array_to_list(arr, 5, head, tail); show_list(head, tail);的时候用不用加啥头文件 ...

这些函数都是我自己实现的，就在源文件里，所以不需要加载其他头文件了。

use a stack
https://gist.github.com/flatlight/5082271

* Method: Get the middle of the list, reverse the second half,
* compare the first and the second half.

C language:
https://gist.github.com/hukun01/5082379

* Solution: first to find the lenght of the linkedlist; then sotre the first half of the linked list in a stack, then compare with the second half of the linked list
* Time complexity: O(n);  Space complexity: O(n)

C/C++ implementation
https://github.com/StanleyLee/CareerCup/blob/master/2_7.cpp