Java有效的回文

剑指offer Ⅱ018.有效的回文

解题思路:
Character.isLetterOrDigit(char c): 判断字符是不是字母或者数字
Character.toLowerCase(char c): 把这个字符转为小写

class Solution {
    public boolean isPalindrome(String s) {
        if(s == null || s.length() == 0){
            return true;
        }
        int left = 0, right = s.length() - 1;
        while(left <= right){
            while(left < right && !Character.isLetterOrDigit(s.charAt(right))) right--;
            while(left < right && !Character.isLetterOrDigit(s.charAt(left))) left++;
            if((Character.toLowerCase(s.charAt(left)) != (Character.toLowerCase(s.charAt(right))))){
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
}

---

剑指offer Ⅱ014.字符串中的变位词

class Solution {
    public boolean checkInclusion(String s1, String s2) {
        int[] arr1 = new int[26];
        int[] arr2 = new int[26];
        if(s1.length() > s2.length()){
            return false;
        }
        for(int i = 0; i < s1.length(); i++){
            arr1[s1.charAt(i) - 'a']++;
            arr2[s2.charAt(i) - 'a']++;
        }
        if(Arrays.equals(arr1, arr2)){
            return true;
        }
        for(int i = s1.length(); i < s2.length(); i++){
            arr2[s2.charAt(i) - 'a']++;
            arr2[s2.charAt(i - s1.length()) - 'a']--;
            if(Arrays.equals(arr1, arr2)){
            return true;
            }
        }
        return false;
    }
}