Solved

Taking punctuation marks and spaces out've a string

Posted on 2008-10-10
1
1,053 Views
Last Modified: 2012-05-05
I am writing some code where i have to reverse a word, place only alphabetical characters onto the stack and the queue, and convert all uppercase letters to lowercase and check to see if its a palindrome and im supposed to use a Queue and a Stack.


So my question is, how do i implement sometime of checking to make sure i only put alphabetical characters onto the stack?

The input file im using will only have spaces and punctuation marks.
import java.util.*;

import java.io.*;

import java.lang.*;

 

class LetterStack

	{

	private int maxSize;

	private char[] stackArray;

	private int top;

	

	public LetterStack(int max)

		{

		maxSize = max;

		stackArray = new char[maxSize];

		top = -1;

		}

	public void push(char j)

		{

		stackArray[++top] = j;

		}

	public char pop()

		{

		return stackArray[top--];

		}

	public char peek()

		{

		return stackArray[top];

		}

	public boolean isEmpty()

		{

		return (top == -1);

		}

	}

class Reverse

	{

	private String input;

	private String output;

	

	public Reverse(String in)

	{

	input = in;

	}

	public String doRev()

	{

	int stackSize = input.length();

	LetterStack tehStack = new LetterStack(stackSize);

	for(int j=0; j<input.length(); j++)

		{

		char ch = input.charAt(j);

		tehStack.push(ch);

		}

	output = "";

	while( !tehStack.isEmpty() )

		{

		char ch = tehStack.pop();

		output = output + ch;

		}

	return output;

	}

}

 

public class PalindromeApp{

	public static void main (String[] args) throws IOException{

		String input,output;

		Scanner inFile = new Scanner(new FileReader(args[0]));

		PrintWriter outFile = new PrintWriter(args[1]);

		while(inFile.hasNext())

			{

			input = inFile.nextLine();

			Reverse  tehReverse = new Reverse(input);

			output = tehReverse.doRev();

			if(input.equals(output))

				outFile.println("PALDINDROME");

			else

				outFile.println("NOT PALINDROME");

			}

		outFile.close();

		}

		

	}

Open in new window

0
Comment
Question by:austinemser
1 Comment
 
LVL 3

Accepted Solution

by:
gcauthon earned 500 total points
ID: 22690636
if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z') tehStack.push(ch);
0

Featured Post

Find Ransomware Secrets With All-Source Analysis

Ransomware has become a major concern for organizations; its prevalence has grown due to past successes achieved by threat actors. While each ransomware variant is different, we’ve seen some common tactics and trends used among the authors of the malware.

Join & Write a Comment

Suggested Solutions

Title # Comments Views Activity
scoresSpecial  challenge 13 42
array220 challenge 8 48
strCopies  challenge 17 73
advertisement module in core php 4 92
For customizing the look of your lightweight component and making it look lucid like it was made of glass. Or: how to make your component more Apple-ish ;) This tip assumes your component to be of rectangular shape and completely opaque. (COD…
Java had always been an easily readable and understandable language.  Some relatively recent changes in the language seem to be changing this pretty fast, and anyone that had not seen any Java code for the last 5 years will possibly have issues unde…
Viewers learn about the third conditional statement “else if” and use it in an example program. Then additional information about conditional statements is provided, covering the topic thoroughly. Viewers learn about the third conditional statement …
Video by: Michael
Viewers learn about how to reduce the potential repetitiveness of coding in main by developing methods to perform specific tasks for their program. Additionally, objects are introduced for the purpose of learning how to call methods in Java. Define …

759 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

20 Experts available now in Live!

Get 1:1 Help Now