Comment
qwerty
Pallindrome made easy,
March 23, 2010 at 11:05 PM
March 23, 2010 at 11:05 PM
Thtz a very difficult way to solve an easier problem.....
it can be something like this
public class pallindrome
{
public static void main(String k[])
{
using_StringBuilder();
using_array();
}
public static void using_array()
{
System.out.println("Using Old C like Array");
String str="100001";
char [] a=str.toCharArray();
String str1="";
for(int i=a.length-1;i>=0;i--)
{
str1=str1+a[i];
}
if(str.equalsIgnoreCase(str1))
{
System.out.println("Pallindrome");
}
else
{
System.out.println("No Pallindrome");
}
}
public static void using_StringBuilder()
{
System.out.println("Using Java Like StringBuilder");
String str="12321";
char [] a=str.toCharArray();
StringBuilder strbld=new StringBuilder();
for(int i=a.length-1;i>=0;i--)
{
strbld.append(a[i]);
}
String str1=strbld.toString();
if(str.equalsIgnoreCase(str1))
{
System.out.println("Pallindrome");
}
else
{
System.out.println("No Pallindrome");
}
}
}
View All Comments | View Tutorial
it can be something like this
public class pallindrome
{
public static void main(String k[])
{
using_StringBuilder();
using_array();
}
public static void using_array()
{
System.out.println("Using Old C like Array");
String str="100001";
char [] a=str.toCharArray();
String str1="";
for(int i=a.length-1;i>=0;i--)
{
str1=str1+a[i];
}
if(str.equalsIgnoreCase(str1))
{
System.out.println("Pallindrome");
}
else
{
System.out.println("No Pallindrome");
}
}
public static void using_StringBuilder()
{
System.out.println("Using Java Like StringBuilder");
String str="12321";
char [] a=str.toCharArray();
StringBuilder strbld=new StringBuilder();
for(int i=a.length-1;i>=0;i--)
{
strbld.append(a[i]);
}
String str1=strbld.toString();
if(str.equalsIgnoreCase(str1))
{
System.out.println("Pallindrome");
}
else
{
System.out.println("No Pallindrome");
}
}
}
View All Comments | View Tutorial
Related Tutorial and Articles
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.
Tutorial Topics
