LeetCode-探索-初级算法-字符串-5. 验证回文字符串(个人做题记录,不是习题讲解)
LeetCode探索-初级算法:https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/
- 验证回文字符串
-
语言:java
-
思路:就先把字符串转成小写,然后两头用指针比较,如果不是数字和字母就跳过
-
代码(4ms):
class Solution { public boolean isPalindrome(String s) { s = s.toLowerCase(); char[] arr = s.toCharArray(); int len = arr.length; for(int i=0,j=len-1;i<j;){ if(!('a'<=arr[i]&&arr[i]<='z'||'0'<=arr[i]&&arr[i]<='9')){ ++i; continue; } if(!('a'<=arr[j]&&arr[j]<='z'||'0'<=arr[j]&&arr[j]<='9')){ --j; continue; } if(arr[i]!=arr[j]) return false; ++i; --j; } return true; } }
-
参考代码(2ms):思路是一样的,不过他用了手动转换大小写,所以运行要快一点
class Solution { public boolean isPalindrome(String s) { char ch[]=s.toCharArray(); int n=0; for(int i=0;i<ch.length;i++){ if(ch[i]>='0'&&ch[i]<='9'||ch[i]>='a'&&ch[i]<='z') ch[n++]=ch[i]; else if(ch[i]>='A'&&ch[i]<='Z') { char t=(char)(ch[i]+32); ch[n++]=t; } } int l=0,h=n-1; while(l<h){ if(ch[l++]!=ch[h--]) return false; } return true; } }