首页 > 代码库 > LeetCode——Valid Palindrome
LeetCode——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 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.
原题链接:https://oj.leetcode.com/problems/valid-palindrome/题目:给定一个字符串,检测其是否是回文串,只考虑字母数字字符。
思路:过滤源字符串中的非字母数字,组成一个新串,对新串进行判断。
public static boolean isPalindrome(String s) { if(s.isEmpty()) return true; //过滤字母数字之外的字符 StringBuffer buf = new StringBuffer(); for(int i=0;i<s.length();i++){ if(Character.isLetterOrDigit(s.charAt(i))) buf.append(s.charAt(i)); } String tmp = buf.toString().toLowerCase(); for(int i=0;i<tmp.length();i++){ if(tmp.charAt(i) != tmp.charAt(tmp.length() - i - 1)) return false; } return true; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。