Java for LeetCode 125 Valid Palindrome

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

For example,
"A man, a plan, a canal: Panama" is a palindrome.
"race a car" is not a palindrome.

解题思路:

注意题目,忽略大小写,忽略非字母或数字,JAVA实现如下:

    public boolean isPalindrome(String s) {
    	if(s.length()<=1)
    		return true;
        int left=0,right=s.length()-1;
        while(left<right){
        	if(!Character.isLetterOrDigit(s.charAt(left))){
        		left++;
        		continue;
        	}
        	if(!Character.isLetterOrDigit(s.charAt(right))){
        		right--;
        		continue;
        	}
        	if(Character.toUpperCase(s.charAt(left))!=Character.toUpperCase(s.charAt(right)))
        		return false;
        	left++;
        	right--;
        }
        return true;
    }
时间: 2024-08-28 10:40:55

Java for LeetCode 125 Valid Palindrome的相关文章

leetCode 125. Valid Palindrome 字符串

125. Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. Note:Hav

Java [Leetcode 125]Valid Palindrome

题目描述: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. Note:Have you consider t

leetcode 125. Valid Palindrome ----- java

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. Note:Have you consider that th

[LeetCode] 125. Valid Palindrome 有效回文

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. Note:Have you consider that th

leetcode 125. Valid Palindrome

题目描述 c语言中的tolowe(A)函数,将字符A转换为小写: isalpha(a) 判断a是不是一个字符 isdigital(a)判断a是不是一个数字,isalnum(a)判断a是不是一个数字或者字符 只判断字符串中字符是不是回文 空字符串是一个回文字符串 class Solution { public: bool isPalindrome(string s) { int i = 0; int j = s.size() -1; while(i < j){ while(!isalnum(s[i

leetcode -day13 Valid Palindrome &amp; Triangle &amp; Pascal&#39;s Triangle I II

1.  Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. Note:

125. Valid Palindrome【easy】

125. Valid Palindrome[easy] Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. No

125. Valid Palindrome(js)

125. Valid Palindrome 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

【LeetCode】125 - Valid Palindrome

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a palindrome. Note:Have you consider that th