![]() |
Sponsored Link •
|
Advertisement
|
Advertisement
|
This page contains an archived post to the Java Answers Forum made prior to February 25, 2002. If you wish to participate in discussions, please visit the new Artima Forums.
Message:
> > I am having problems creating a stack and queue. The problem is as the following: > > A Palindrome is a word which reads the same both backwords and fowards. One way to check whether a word is a palindrome is to take each letter of the word one at a time and to place them onto a pile. The letters are then read back from these structures and, if all letters match, the word is a palindrome.e.g tot.
Replies:
|
Sponsored Links
|