FTPrep, 125 Valid Palindrome

主要是会用Character类里的一些方法:

Character.isLetterOrDigit();

Character.isLetter ();

Character.isDigit();

Character.toUpperCase();

Character.toLowerCase();

这个还蛮重要的。

代码:

class Solution {
    public boolean isPalindrome(String s) {
        if(s.equals("")) return true;
        int len = s.length();
        int left=0, right=len-1;
        while(left<right){
            while(!Character.isLetterOrDigit(s.charAt(left))&& left<right) left++;
            while(!Character.isLetterOrDigit(s.charAt(right))&& left<right) right--;
            char leftChar = Character.isLetter(s.charAt(left))?Character.toLowerCase(s.charAt(left)):s.charAt(left);
            char rightChar = Character.isLetter(s.charAt(right))?Character.toLowerCase(s.charAt(right)):s.charAt(right);
            if(leftChar!=rightChar) return false;
            left++;  // I even forget these two steps!! shame!! for every while() you should change the condition!! 
            right--;  // for inside while(), may include the out while condition again, if it is for the index
        }
        return true;
    }
}
// lesson learned: static char Character.isLetterOrDigit(char a), is the API to use! not Digits, it is Digit
// TODO: for all the palindrome questions, put them together and compare. The question I can think of: palindrome numbers. Parens is somehow a palindrome question, but palindrome can be much more diversed.


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值