首页 > 代码库 > [Leetcode][JAVA] Valid Palindrome
[Leetcode][JAVA] 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.
应该算是leetcode上最简单的题之一了吧。双指针可搞定。。
1 public boolean isPalindrome(String s) { 2 int i=0; 3 int j=s.length()-1; 4 while(i<j) { 5 if(!Character.isLetterOrDigit(s.charAt(i))) { 6 i++; 7 continue; 8 } 9 if(!Character.isLetterOrDigit(s.charAt(j))) {10 j--;11 continue;12 }13 if(Character.toLowerCase(s.charAt(i))!=Character.toLowerCase(s.charAt(j)))14 return false;15 i++;16 j--;17 }18 return true;19 }
[Leetcode][JAVA] Valid Palindrome
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。