algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-09 20:20:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Palindrome.java

Browse Source
This commit is contained in:
Libin Yang
2018-12-24 10:01:45 +08:00
committed by GitHub
parent a5bf69fcbd
commit 2d383bf48e
1 changed files with 20 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
Others/Palindrome.java
View File

@ -1,28 +1,23 @@
class Palindrome { class Palindrome {
private String reverseString(String x){ //*helper method private String reverseString(String x) { // *helper method
String output = ""; StringBuilder output = new StringBuilder(x);
for(int i=x.length()-1; i>=0; i--){ return output.reverse().toString();
output += x.charAt(i); //addition of chars create String }
}
return output;
}
public boolean FirstWay(String x) { // *palindrome method, returns true if palindrome
if (x == null || x.length() <= 1)
return true;
return x.equalsIgnoreCase(reverseString(x));
}
public Boolean FirstWay(String x){ //*palindrome method, returns true if palindrome public boolean SecondWay(String x) {
if(x == null || x.length() <= 1) if (x.length() == 0 || x.length() == 1)
return true; return true;
return (x.equalsIgnoreCase(reverseString(x)));
}
public boolean SecondWay(String x) if (x.charAt(0) != x.charAt(x.length() - 1))
{ return false;
if (x.length() == 0 || x.length() == 1)
return true;
if (x.charAt(0) != x.charAt(x.length() - 1)) return SecondWay(x.substring(1, x.length() - 1));
return false; }
}
return SecondWay(x.substring(1 , x.length() - 1));
}
}