【LeetCode-面试算法经典-Java实现】【125-Valid Palindrome(回文字验证)】

【125-Valid Palindrome(回文字验证)】


【LeetCode-面试算法经典-Java实现】【所有题目目录索引】

原题

  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.

题目大意

  给定一个字符串,判断它是否是回文字符串,仅考虑字母,并且忽略大小写。

解题思路

  使用首尾指针,分别找到第一个符合条件的位置,进行比较,如果相等就进行下一组比较,不相等就返回false,直到所有的字母都处理完。

代码实现

算法实现类

public class Solution {
    public boolean isPalindrome(String s) {

        if (s == null) {
            return false;
        }

        int left = 0;
        int right = s.length() - 1;

        int delta = ‘A‘ - ‘a‘;
        char l;
        char r;

        while (left < right) {
            while (left < s.length() && !isAlphanumericCharacters(s.charAt(left))) { // 从左向右找数字与字母
                left++;
            }

            while (right >= 0 && !isAlphanumericCharacters(s.charAt(right))) { // 从右向左找数字与字母
                right--;
            }

            if (left < right) {
                l = s.charAt(left);
                r = s.charAt(right);
                if (l == r || l - r == delta || r - l == delta) {
                    left++;
                    right--;
                } else {
                    return false;
                }
            }
        }

        return true;
    }

    /**
     * 判断是否是字母或者数字
     *
     * @param c 待判断的数字
     * @return 判断结果
     */
    private boolean isAlphanumericCharacters(char c) {
        return c >= ‘0‘ && c <= ‘9‘ || c >= ‘a‘ && c <= ‘z‘ || c >= ‘A‘ && c <= ‘Z‘;
    }
}

评测结果

  点击图片,鼠标不释放,拖动一段位置,释放后在新的窗口中查看完整图片。

特别说明

欢迎转载,转载请注明出处【http://blog.csdn.net/derrantcm/article/details/47651267

版权声明:本文为博主原创文章,未经博主允许不得转载。

时间: 2024-10-14 14:16:35

【LeetCode-面试算法经典-Java实现】【125-Valid Palindrome(回文字验证)】的相关文章

【LeetCode-面试算法经典-Java实现】【036-Valid Sudoku(验证数独棋盘)】

[036-Valid Sudoku(验证数独棋盘)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partially fi

【LeetCode-面试算法经典-Java实现】【032-Longest Valid Parentheses(最长有效括号)】

[032-Longest Valid Parentheses(最长有效括号)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid paren

【LeetCode-面试算法经典-Java实现】【225-Implement Stack using Queues(用队列实现栈操作)】

[225-Implement Stack using Queues(用队列实现栈操作)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 代码下载[https://github.com/Wang-Jun-Chao] 原题 Implement the following operations of a stack using queues. push(x) – Push element x onto stack. pop() – Removes the element on

【LeetCode-面试算法经典-Java实现】【139-Word Break(单词拆分)】

[139-Word Break(单词拆分)] [LeetCode-面试算法经典-Java实现][全部题目文件夹索引] 原题 Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", di

【LeetCode-面试算法经典-Java实现】【151-Evaluate Reverse Polish Notation(计算逆波兰式)】

[151-Evaluate Reverse Polish Notation(计算逆波兰式)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some

【LeetCode-面试算法经典-Java实现】【019-Remove Nth Node From End of List(移除单链表的倒数第N个节点)】

[019-Remove Nth Node From End of List(移除单链表的倒数第N个节点)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After remo

【LeetCode-面试算法经典-Java实现】【020-Valid Parentheses(括号验证)】

[020-Valid Parentheses(括号验证)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and &qu

【LeetCode-面试算法经典-Java实现】【098-Validate Binary Search Tree(验证二叉搜索树)】

[098-Validate Binary Search Tree(验证二叉搜索树)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys le

【LeetCode-面试算法经典-Java实现】【089-Gray Code(格雷码)】

[089-Gray Code(格雷码)] [LeetCode-面试算法经典-Java实现][所有题目目录索引] 原题 The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print the sequen