Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
stack Palindrome , java
import java.util.*; public class CheckPalindrome{ public static void main(String[]args){ Scanner input=new Scanner(System.in); System.out.print("Enter String: "); String st=input.next(); String str[]=st.split(""); String reversedSt=""; for(int i=str.length-1;i>=0;i--){ reversedSt+=str[i]; } if(st.equalsIgnoreCase(reversedSt)){ System.out.println("String is palindrome"); } else{ System.out.println("String is not palindrome"); } } }
can any one rewrite this code using stacks java stacks?
Related threads:
Re: stack Palindrome , java
I am sure there are those that could, but will anyone do this for you? Probably not (and if they did they would be violating the JPF forum guidelines). Someone can however help you if you show what you've tried in order to implement a Stack, where you are stuck, etc...can any one rewrite this code using stacks java stacks?
Reply With Quote