Java

Java RSS

Palindrome program using stack & queue

•

Join Date: Oct 2009

Posts: 8

Reputation: tnccjavaMatt is an unknown quantity at this point

Solved Threads: 0

tnccjavaMatt tnccjavaMatt is offline

Offline

Newbie Poster

Palindrome program using stack & queue

21 Days Ago

I have two issues that I need to solve on this program that are giving me some troubles. I have scanned google and my text book and so far coming up empty.
Problem #1 - My program works for palindrome words and 2 word palindromes like "race car". But I need it to work for any length of a sentence, like "Borrow or rob?" or "Egad! A base life defiles a bad age". So somehow I need to add code to the isPalindrome method.

Problem #2 - Currently I am using system.out.println (mainly to test program), but the final product must use JOptionPane. The code is currently commented out since it errors out otherwise. Currently I do not have the normal JFrame code that initializes the frame variable, but when I insert it, I get <identifier> expected error messages.

 Help with Code Tags 
 Java Syntax (Toggle Plain Text) 
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.io.*;
 
public class Palindrometest
{
 public static void main(String[] args) throws IOException
 {
  Scanner stdin = new Scanner(System.in);
  //Scanner stdin = new Scanner(new File("input.txt"));
  String line;
 
  do
  {
   System.out.print("Your expression (or return to end): ");
	line = stdin.nextLine();
	if (is_palindrome(line))
	 System.out.println("that is a palindrome");
	 //JOptionPane.showMessageDialog(frame, "That is a palindrome");
	else
	 //JOptionPane.showMessageDialog(frame, "That is NOT a palinfrome"); 
	 System.out.println("that is NOT a palindrome");
  }
  while (line.length() != 0);
 }
 
 public static boolean is_palindrome(String input)
 {
  Queue<Character> q = new LinkedList<Character>();
  Stack<Character> s = new Stack<Character>();
  Character letter;
  int mismatches = 0;
 
  for (int i = 0; i < input.length(); i++)
  {
   letter = input.charAt(i);
	if (Character.isLetter(letter))
	{
	 q.add(letter);
	 s.push(letter);
	}
  }
  while (!q.isEmpty())
  {
   if (q.remove() != s.pop())
	 mismatches++;
  }
  return (mismatches == 0);
 }
}
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.io.*;

public class Palindrometest
{
 public static void main(String[] args) throws IOException
 {
  Scanner stdin = new Scanner(System.in);
  //Scanner stdin = new Scanner(new File("input.txt"));
  String line;
  
  do
  {
   System.out.print("Your expression (or return to end): ");
	line = stdin.nextLine();
	if (is_palindrome(line))
	 System.out.println("that is a palindrome");
	 //JOptionPane.showMessageDialog(frame, "That is a palindrome");
	else
	 //JOptionPane.showMessageDialog(frame, "That is NOT a palinfrome"); 
	 System.out.println("that is NOT a palindrome");
  }
  while (line.length() != 0);
 }
 
 public static boolean is_palindrome(String input)
 {
  Queue<Character> q = new LinkedList<Character>();
  Stack<Character> s = new Stack<Character>();
  Character letter;
  int mismatches = 0;
  
  for (int i = 0; i < input.length(); i++)
  {
   letter = input.charAt(i);
	if (Character.isLetter(letter))
	{
	 q.add(letter);
	 s.push(letter);
	}
  }
  while (!q.isEmpty())
  {
   if (q.remove() != s.pop())
	 mismatches++;
  }
  return (mismatches == 0);
 }
}

Last edited by tnccjavaMatt; 21 Days Ago at 10:58 pm.

•

Join Date: Sep 2008

Posts: 1,563

Reputation: BestJewSinceJC is a name known to all

Solved Threads: 196

BestJewSinceJC BestJewSinceJC is offline

Offline

Posting Virtuoso

21 Days Ago

First you need to define what you consider a palindrome. Typically a palindrome is considered any String with the same characters (in both directions) regardless of case and regardless of spacing. So your isPalindrome method should

1. Remove all whitespace from your String (you can do this by using google) and typing "Java remove whitespace from string". I'd be careful to look at the solutions first, because I just took a look and some are much simpler than others.
2. Convert the entire thing to uppercase or lowercase (doesn't matter which) . . just use the toUpperCase method.
3. Scan each character at the front and at the back, making sure they match, until you reach the middle. If you can't figure out how to do this you can google for a palindrome program, there are plenty of examples.

Out.

•

Join Date: Oct 2009

Posts: 8

Reputation: tnccjavaMatt is an unknown quantity at this point

Solved Threads: 0

tnccjavaMatt tnccjavaMatt is offline

Offline

Newbie Poster

21 Days Ago

•

Originally Posted by BestJewSinceJC

First you need to define what you consider a palindrome. Typically a palindrome is considered any String with the same characters (in both directions) regardless of case and regardless of spacing. So your isPalindrome method should

1. Remove all whitespace from your String (you can do this by using google) and typing "Java remove whitespace from string". I'd be careful to look at the solutions first, because I just took a look and some are much simpler than others.
2. Convert the entire thing to uppercase or lowercase (doesn't matter which) . . just use the toUpperCase method.
3. Scan each character at the front and at the back, making sure they match, until you reach the middle. If you can't figure out how to do this you can google for a palindrome program, there are plenty of examples.

Okay, I'm just about finished. The program now works on words and sentences, it properly ignores whitespace and punctuation, it pops output to JOptionPane. The only remaining problem didn't start until I switched from System.out.println to the JOptionPane. With the system.out.... when I pressed enter to exit, it exited, now with JOptionPane, enter doesn't exit. How do I fix?

 Help with Code Tags 
 Java Syntax (Toggle Plain Text) 
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.io.*;
import java.awt.*;
import javax.swing.*;
 
public class Palindrometest
{
 public static void main(String[] args) throws IOException
 {
  JFrame frame = new JFrame();
  frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
 
  Scanner stdin = new Scanner(System.in);
  //Scanner stdin = new Scanner(new File("input.txt"));
  String line;
 
  do
  {
   System.out.print("Your expression (or return to end): ");
	line = stdin.nextLine();
	//The next 3 lines removes upper case letters, whitespace and punctuation.
	line = line.toLowerCase();
	line = line.replaceAll(" ", "");
	line = line.replaceAll("\\W","");
	if (is_palindrome(line))
	 //System.out.println("that is a palindrome");
	 JOptionPane.showMessageDialog(frame, "That is a palindrome");
	else
	 JOptionPane.showMessageDialog(frame, "That is NOT a palinfrome"); 
	 //System.out.println("that is NOT a palindrome");
  }
  while (line.length() != 0);
 }
 
 public static boolean is_palindrome(String input)
 {
  Queue<Character> q = new LinkedList<Character>();
  Stack<Character> s = new Stack<Character>();
  Character letter;
  int mismatches = 0;
 
  for (int i = 0; i < input.length(); i++)
  {
   letter = input.charAt(i);
	if (Character.isLetter(letter))
	{
	 q.add(letter);
	 s.push(letter);
	}
  }
  while (!q.isEmpty())
  {
   if (q.remove() != s.pop())
	 mismatches++;
  }
  return (mismatches == 0);
 }
}
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.io.*;
import java.awt.*;
import javax.swing.*;

public class Palindrometest
{
 public static void main(String[] args) throws IOException
 {
  JFrame frame = new JFrame();
  frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
  
  Scanner stdin = new Scanner(System.in);
  //Scanner stdin = new Scanner(new File("input.txt"));
  String line;
  
  do
  {
   System.out.print("Your expression (or return to end): ");
	line = stdin.nextLine();
	//The next 3 lines removes upper case letters, whitespace and punctuation.
	line = line.toLowerCase();
	line = line.replaceAll(" ", "");
	line = line.replaceAll("\\W","");
	if (is_palindrome(line))
	 //System.out.println("that is a palindrome");
	 JOptionPane.showMessageDialog(frame, "That is a palindrome");
	else
	 JOptionPane.showMessageDialog(frame, "That is NOT a palinfrome"); 
	 //System.out.println("that is NOT a palindrome");
  }
  while (line.length() != 0);
 }
 
 public static boolean is_palindrome(String input)
 {
  Queue<Character> q = new LinkedList<Character>();
  Stack<Character> s = new Stack<Character>();
  Character letter;
  int mismatches = 0;
  
  for (int i = 0; i < input.length(); i++)
  {
   letter = input.charAt(i);
	if (Character.isLetter(letter))
	{
	 q.add(letter);
	 s.push(letter);
	}
  }
  while (!q.isEmpty())
  {
   if (q.remove() != s.pop())
	 mismatches++;
  }
  return (mismatches == 0);
 }
}

•

Join Date: Sep 2008

Posts: 1,563

Reputation: BestJewSinceJC is a name known to all

Solved Threads: 196

BestJewSinceJC BestJewSinceJC is offline

Offline

Posting Virtuoso

20 Days Ago

If you change your JOptionPanes from using "frame" as their first argument to using "null" as their first argument, your program will work. Alternatively, you could continue to use "frame" as the first argument to your JOptionPanes and add the line "frame.dispose()" after each JOptionPane is created and it will work.

Out.

•

Join Date: Nov 2009

Posts: 1

Reputation: dohn is an unknown quantity at this point

Solved Threads: 0

dohn

Offline

Newbie Poster

help.!

20 Days Ago

i need a complete java program that will accept a string and displays whether the string is palindrome or not, using only one stack implying one stack operation only. use push and pop operation and no string operation should be pperformed..

thanks.. ^^

•

Join Date: Sep 2008

Posts: 1,563

Reputation: BestJewSinceJC is a name known to all

Solved Threads: 196

BestJewSinceJC BestJewSinceJC is offline

Offline

Posting Virtuoso

20 Days Ago

^ Your program won't work without any String operations, unless your String is guaranteed to not have any spaces and the case is guaranteed to be the same throughout. You could potentially ignore spaces and convert the case on the fly, but then why not just do it to begin with? Didn't you listen to anything I said? Anyway, I'll trade you a program for a program:

I need a complete Java program that will translate any English sentence I enter into perfect Spanish. Once you give me this I'll write your program for you. Thanks.

P.S. This isn't your thread, if you had a legitimate question instead of that request for people to do your homework, I would have explained with far less sarcasm. But nobody cares, stop jacking threads.

Last edited by BestJewSinceJC; 20 Days Ago at 4:51 am.

Out.