首页 > 代码库 > Leetcode 125. Valid Palindrome
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 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.
Similar Questions: Palindrome Linked List
Next challenges:
1 public class Solution { 2 public boolean isPalindrome(String s) { 3 int len = s.length(); 4 for(int start = 0, end = len - 1; end > start; ) { 5 if(!Character.isLetterOrDigit(s.charAt(start))) { 6 start++; 7 continue; 8 } 9 if(!Character.isLetterOrDigit(s.charAt(end))) { 10 end--; 11 continue; 12 } 13 if(Character.toLowerCase(s.charAt(start)) != Character.toLowerCase(s.charAt(end))) return false; 14 start++; 15 end--; 16 } 17 return true; 18 } 19 }
Leetcode 125. Valid Palindrome
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。