ID | Title | Difficulty | |
---|---|---|---|
Loading... |
125. Valid Palindrome
Easy
LeetCode
Two Pointers, String
Problem
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Note: For the purpose of this problem, we define empty string as valid palindrome.
Example 1:
Input: "A man, a plan, a canal: Panama"
Output: true
Example 2:
Input: "race a car"
Output: false
Code
class Solution {
public boolean isPalindrome(String s) {
if(s == null || s.length() == 0) return true;
int left = 0;
int right = s.length() - 1;
while(left < right){
while(left < right && !Character.isLetterOrDigit(s.charAt(left))) left++;
while(left < right && !Character.isLetterOrDigit(s.charAt(right))) right--;
if(Character.toLowerCase(s.charAt(left))!= Character.toLowerCase(s.charAt(right))) return false;
left++;
right--;
}
return true;
}
}
按 <- 键看上一题!
124. Binary Tree Maximum Path Sum
按 -> 键看下一题!
126. Word Ladder II