leetCode. isParlindrome

最新推荐文章于 2024-07-20 22:34:59 发布

萝卜丝皮尔

最新推荐文章于 2024-07-20 22:34:59 发布

阅读量39

点赞数

分类专栏：数据结构与算法文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/qq_43448491/article/details/130917170

版权

数据结构与算法专栏收录该内容

106 篇文章 0 订阅

订阅专栏

参考资料：左程云算法课
125. Valid Palindrome
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.

Given a string s, return true if it is a palindrome, or false otherwise.

Example 1:

Input: s = “A man, a plan, a canal: Panama”
Output: true
Explanation: “amanaplanacanalpanama” is a palindrome.

class Solution {
// 方法1
    public boolean isPalindrome1(String s) {
        char[] str = s.toCharArray();
        StringBuilder builder = new StringBuilder();

        for(char ch:str)
        {
            if((ch>='0'&&ch<='9')||('a'<=ch&&ch<='z'))
            {
                builder.append(ch);
            }else if('A'<=ch&&ch<='Z')
            {
                builder.append((char)(ch-('A'-'a')));
            }
        }

        String s2 = builder.toString();
        return s2.equals(builder.reverse().toString());
    }



// 方法2： 双指针法
     public boolean isPalindrome(String s) {
     // two pointers
     char[] str = s.toCharArray();
     int L=0;
     int R = str.length-1;

     while(L<=R)
     {
         if(valid(str[L])&&valid(str[R]))
         {
             if(equal(str[L],str[R]))
             {
                 L++;
                 R--;
             }else{
                 return false;
             }
         }else{
             L+=valid(str[L])?0:1;
             R-=valid(str[R])?0:1;
         }
     }
    return true;
    }
     public boolean valid(char ch)
     {
         return isNume(ch)||isAlph(ch);
     }
     public boolean isNume(char ch)
     {
         return ch>='0' && ch<='9';
     }
     public boolean isAlph(char ch)
     {
         return (ch>='a' && ch<='z')||(ch>='A' && ch<='Z');
     }
     public boolean equal(char ch1, char ch2)
     {
         if(isNume(ch1)||isNume(ch2))
         {
             return ch1==ch2;
         }
         return ch1==ch2 || Math.max(ch1,ch2)-Math.min(ch1,ch2)==32;
     }
}