[priya_lorha]

[\code]class palin
{public static void main(String args[])
{ int i,j,k,l,lp,counter=0;
String m="my mom chocolate cake icecream arora madam dog coco kaka itat papa",n="",o,p="";
char ch=' ',ph=' ',bh=' ',kh=' ';
l=m.length();
// loop
for(i=0;i<l;i++)
{ch=m.charAt(i);
if(ch==' '){break;}
p=m.substring(0,i);
continue;}
lp=p.length();
for(j=lp-1;j>=0;j--)
{ch=p.charAt(j);
n=n+ch;System.out.println(n);
}if(n.equalsIgnoreCase(p));
{System.out.println("The word is pallindrome");
System.out.println(p);
counter++;
}System.out.println("nos of pallindrome words="+counter);}
}





[\code]

This post has been edited by priya_lorha: 18 January 2009 - 06:52 AM

[priya_lorha]

[code]class palin
{public static void main(String args[])
{ int i,j,k,l,lp,counter=0;
String m="my mom chocolate cake icecream arora madam dog coco kaka itat papa",n="",o,p="";
char ch=' ',ph=' ',bh=' ',kh=' ';
l=m.length();
// loop
for(i=0;i<l;i++)
{ch=m.charAt(i);
if(ch==' '){break;}
p=m.substring(0,i);
continue;}
lp=p.length();
for(j=lp-1;j>=0;j--)
{ch=p.charAt(j);
n=n+ch;System.out.println(n);
}if(n.equalsIgnoreCase(p));
{System.out.println("The word is pallindrome");
System.out.println(p);
counter++;
}System.out.println("nos of pallindrome words="+counter);}
}





[\code]

[Gloin]

Please don't double post and try to fix your code tags. The end tag is supposed to be [ /code] (without the blank), not [\code]
Take care of that and please state your problem and I'll try to help you out.

This post has been edited by Gloin: 18 January 2009 - 06:57 AM

[nick2price]

And please, your code is very hard to read which just makes it harder for people to help you. Use proper indentation to help yourself and us.

[Gloin]

The indentation is usually lost when you don't have the code tags since a blank can hardly be seen.

[Cup_of_java]

do you know the difference between:

word=word+newWord;

and

word=newWord+word?

create a new word that is the pallindrome of the word you're checking, then compare the two, if they equal, counter++;

[macosxnerd101]

I had to do this assignment for my programming class. Here's my logic: First, create 2 ArrayLists; one to hold the letters in the string going from 0 to length-1, and the second to hold the letters in the string in reverse order. From there just compare the characters in the lists. If two characters at the same index don't match, then the string isn't a palindrome. The method I used is the Character.isLetter() method.

[pbl]

Why re-inventing the wheel ?
Use a StringTokenizer !!!

StringTokenizer st = new StringTokenizer(m);
while(st.hasNext()) {
   String nextWord = st.next();
}

Duplicate topics: topics merged

[mostyfriedman]

i agree with pbl, why reinvent the wheel, but since you dont want to use the split method or tokenizer and you wanna do the splitting yourself then.

import java.util.Scanner;
public class NumberOfPalindromes
{
	public static void main(String[]args)
	{
		Scanner sc = new Scanner(System.in);
		String s = sc.nextLine();
		String x = "";
		int i = 0;
		while(i < s.length())
		{
			x = "";
			if(s.charAt(i) == ' ')
				i++;
			do
			{
				x += s.charAt(i);
				i++;
			}
			while(i < s.length() && s.charAt(i) != ' ');		
		}
		
	}
}

this algorithm will assign word by word(with spaces as delimiter) to String x on each iteration, then you can pass x to another method which checks for palindromes, also you will need to add an if statement and a counter variable to count the number of palindromes...
note though that when i wrote this algorithm i assumed that the user will enter the string with exactly one space between words, i didnt take into account if the user entered something like("welcome to dic ") only things like ("welcome to dic") with a single space between words..anyway i hope this helps and good luck

This post has been edited by mostyfriedman: 18 January 2009 - 04:55 PM