首页 > 代码库 > [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.
代码:
import java.util.Vector; public class Valid_Palindrome { public boolean isPalindrome(String s) { s = s.toLowerCase(); Vector<Character> vector = new Vector<Character>(); for(int i = 0; i< s.length(); i++){ Character ch = s.charAt(i); if((ch >='a' && ch <='z' )||(ch >='0' && ch <='9')) vector.add(ch); } if(vector.size() == 0) return true; int size = vector.size(); for(int i=0; i< size/2; i++){ if(vector.get(i) != vector.get(size-1-i)) return false; } return true; } }
[leetcode]Valid Palindrome
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。