Java program to check the given string is palindrome or not without using Reverse String

-

Simple Java program to check the given string is palindrome or not without using Reverse String

Code:

import java.util.Scanner;

class p84{public static void main(String args[]){

Scanner sc = new Scanner(System.in);

String s = sc.nextLine();

boolean palindrome=true;

int j=(s.length()-1);

for(int i=0;i<(s.length()/2);i++){

if(s.charAt(i)!=s.charAt(j)){palindrome=false;}

j--;

}

if(palindrome){System.out.println("palindrome");}

else{System.out.println("Not palindrome");}

}}

Comments

Post a Comment

Popular posts from this blog

C program to implement Circular Linked List

-
Simple C program to implement Circular Linked List with following operations: Insert a number Insert at front Insert after Insert before Delete at end Delete from front Delete after Delete before Delete itself Display from front Code: #include<stdio.h> #include<conio.h> #include<stdlib.h> struct node{ int data; struct node *next; struct node *prev; }; struct node *head,*tail; void insertend(){ int val; printf("\nEnter the value to be Entered: "); scanf("%d",&val); struct node *head2; head2=head; struct node *temp; temp=(struct node*)malloc(sizeof(struct node)); temp->data=val; temp->next=NULL; temp->prev=NULL; if(head==NULL){ head=temp; temp->next=head; temp->prev=head; } else{ while(head2->next!=head){ head2=head2->next; } temp->prev=head2; temp->next=head; head2->next=temp; tail=temp; head->prev=tail; } } void insertf(){ int val; printf("Enter a value to be ent...
Read more

C++ program to perform data transformation Min-max and Z score Normalization

-
Simple C++ program to perform data transformation using min-max normalization, z-score normalization and decimal scaling operation. Code: #include<iostream> #include<math.h> using namespace std; int main() { int n; double sum=0; cout<<"Enter The Number of values:"; cin>>n; int a[n],r1,r2; for(int i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter starting and ending range for normalization:"; cin>>r1>>r2; double max = a[0]; int min = a[0]; for (int i = 0; i <n; i++) { if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } float v[n];double temp; for(int i=0;i<n;i++) { temp=double(double(double(a[i]-min)*(r2-r1))/(max-min))+ r1; v[i]=temp; } cout<<"normalization by Min-max"<<endl; cout<<"Values a...
Read more

Java program to implement Word Count using Map-Reduce in Hadoop Cluster

-
Simple Java program to implement Word Count using Map-Reduce in Hadoop Cluster Code: import java.io.IOException; import java.util.StringTokenizer;  import org.apache.hadoop.conf.Configuration; import org.apache.hadoop.fs.Path; import org.apache.hadoop.io.IntWritable; import org.apache.hadoop.io.Text; import org.apache.hadoop.mapreduce.Job; import org.apache.hadoop.mapreduce.Mapper; import org.apache.hadoop.mapreduce.Reducer; import org.apache.hadoop.mapreduce.lib.input.FileInputFormat; import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;   public class wc {     public static class TokenizerMapper     extends Mapper<Object, Text, Text, IntWritable>{   private final static IntWritable one = new IntWritable(1); private Text word = new Text();   public void map(Object key, Text value, Context context                 ) throws IOException, InterruptedException {   StringTokenizer ...
Read more