leetCode3.1(Valid Palindrome)
来源:互联网 发布:国外网络代理 编辑:程序博客网 时间:2024/06/10 06:35
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.
设置左右两个指针扫描即可,在扫描的过程中要注意对非字母字符的处理
public static boolean solution_3_1(String str){String temp=str.toLowerCase();if(temp.equals("")){return true;}else{int left=0;int right=temp.length()-1;while(left<right){while(!isvalid(temp.charAt(left)))left++;while(!isvalid(temp.charAt(right)))right--;if(temp.charAt(left)==temp.charAt(right)){char c1=temp.charAt(left);char c2=temp.charAt(right);left++;right--;}else{return false;}}return true;}}private static boolean isvalid(char c){if(c>='a'&&c<='z')return true;if(c>='0'&&c<='9')return true;return false;}
0 0
- leetCode3.1(Valid Palindrome)
- LeetCode3.1 @ Valid Palindrome 检验回文串 D2F5
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- valid palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Valid Palindrome
- Python 读Dict数据的方法,解决key 不在dict的问题,get()函数,setdefault()函数
- 树状数组+公式推导 hdu 3015 Disharmony Trees
- 软件测试模型之V模型和W模型
- spring,springMVC,MyBatis,Junit 搭建过程
- NYOJ 228 士兵杀敌(五)(数组灵活运用)
- leetCode3.1(Valid Palindrome)
- java基础-网络编程
- 简易机顶盒launcher开发技术积累
- ubuntu15.04下安装jdk8
- Javascript高级程序设计第十二章
- WEB前端-IE6,IE7,IE8,IE9,Firefox兼容性问题
- 如何删除字符串中重复的字符
- eclipse设置字体大小
- 12.责任链模式(设计模式笔记)