Skip to content

Added a Palindrome Checker #48

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Added a Palindrome Checker #48

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
73a504c
Added a Palindrome Checker
RockLee444 Oct 16, 2019
eca4a40
Changed a few variables
RockLee444 Oct 16, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
50 changes: 50 additions & 0 deletions String Reversal/Palindrome.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
/*RockLee444*/
import java.util.Scanner;
public class Palindrome{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String word;
System.out.println("Write a sentence and press enter to know if it is a palindrome.");
word = sc.nextLine();
String[] wordArray = word.toUpperCase().split(" ");
String noBlanksWord="";
for(int i=0;i<wordArray.length;i++){
noBlanksWord+=wordArray[i];
}

if(verifyWord(noBlanksWord)){
System.out.println("The sentence: " + word + " IS a palindrome.");
} else {
System.out.println("The sentence: " + word + " IS NOT a palindrome.");
}
sc.close();

}

public static boolean verifyWord(String word){
boolean isPalindrome = false;
char[] normalWordArray = word.toCharArray();
char[] inverseWordArray = new char[normalWordArray.length];

int j=0;
//Filling the inverseWordArray
for(int i=normalWordArray.length-1;i>=0;i--){
inverseWordArray[j] = normalWordArray[i];
j++;
}
//Verifying if it is palindrome
int counter=0;
for(int i=0; i<normalWordArray.length;i++){
if(normalWordArray[i] == inverseWordArray[i]){
counter++;
}
}
if(counter==normalWordArray.length){
isPalindrome = true;
}
else{
isPalindrome = false;
}
return isPalindrome;
}
}