No125

Author: tujietg

leetcode/String/No125.java

@@ -0,0 +1,26 @@
+class Solution {
+    public boolean isPalindrome(String s) {
+        if(s.isEmpty()){
+            return true;
+        }
+        int head = 0, end = s.length() - 1;
+        char chead ;
+        char cend ;
+        while(head <= end){
+              chead = s.charAt(head);
+              cend = s.charAt(end);
+              if(!Character.isLetterOrDigit(chead)){
+                  head++;
+              }else if(!Character.isLetterOrDigit(cend)){
+                  end--;
+              }else{
+                  if(Character.toLowerCase(chead) != Character.toLowerCase(cend)){
+                      return false;
+                  }
+                  head++;
+                  end--;
+              }
+        }
+        return true;
+    }
+}