[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 the string might be empty? This is a good question to ask during an interview.

For the purpose of this problem, we define empty string as valid palindrome.

题意及分析：给出一个字符串，只考虑其中的字母或者数字字符，问字符串是否是一个回文，注意空字符串也是回文。

方法一：先遍历一次字符串去除非数字字母字符，然后判断是否是回文，复杂度为n+n/2

class Solution {public boolean isPalindrome(String s) {if(s == null || s.length() == 0 ) return true;StringBuilder sb = new StringBuilder();for(int i=0;i<s.length();i++){      //取出标点符号，只留下字母char ch = s.charAt(i);if(Character.isLetterOrDigit(ch)){sb.append(ch);}}//全部变为小写字母String newStr = sb.toString().toLowerCase();for(int i=0;i<newStr.length()/2;i++){if(newStr.charAt(i)!=newStr.charAt(newStr.length()-1-i))return false;}return true;}
}

方法二：直接判断，每次分别从前和从后找到一个字母数字字符，若不相等直接返回false，复杂度最多为n

class Solution {public boolean isPalindrome(String s) {if(s == null || s.length() == 0 ) return true;int i = 0,j = s.length()-1;for(i=0,j=s.length()-1;i<j;++i,--j){while(i<j && !Character.isLetterOrDigit(s.charAt(i))) i++;while(i<j && !Character.isLetterOrDigit(s.charAt(j))) j--;if(i<j && Character.toLowerCase(s.charAt(i))!=Character.toLowerCase(s.charAt(j))) return false;}return true;}
}

转载于:https://www.cnblogs.com/271934Liao/p/7765360.html

[LeetCode] 125. Valid Palindrome Java相关推荐

【回文串3】LeetCode 125. Valid Palindrome
LeetCode 125. Valid Palindrome Solution1:我的答案复杂度为O(n)O(n)O(n),写法不是很简练啊. class Solution { public:boo ...
[勇者闯LeetCode] 125. Valid Palindrome
[勇者闯LeetCode] 125. Valid Palindrome Description Given a string, determine if it is a palindrome, con ...
LeetCode 125 Valid Palindrome（有效回文）（*）
版权声明:转载请联系本人,感谢配合!本站地址:http://blog.csdn.net/nomasp https://blog.csdn.net/NoMasp/article/details/5062 ...
LeetCode 125. Valid Palindrome
题目: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ig ...
125 Valid Palindrome
125 Valid Palindrome 链接:https://leetcode.com/problems/valid-palindrome/ 问题描写叙述: Given a string, dete ...
【回文串14】LeetCode 680. Valid Palindrome II
LeetCode 680. Valid Palindrome II Solution1:我的答案复杂度是O(n)O(n)O(n),不算好啊.. 注意:对于c++中string对象常用的insert( ...
leetcode python3 简单题125. Valid Palindrome
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百二十五题 (1)题目英文: Given a string, determin ...
Leet Code OJ 125. Valid Palindrome [Difficulty: Easy]
题目: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ig ...
LeetCode OJ - Valid Palindrome
题目: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ig ...
125. Valid Palindrome
Title 给定一个字符串,验证它是否是回文串,只考虑字母和数字字符,可以忽略字母的大小写. 说明:本题中,我们将空字符串定义为有效的回文串. 示例 1: 输入: "A man, a pla ...

[LeetCode] 125. Valid Palindrome Java

[LeetCode] 125. Valid Palindrome Java相关推荐

最新文章

热门文章