leetcode Valid Palindrome

最新推荐文章于 2019-11-04 14:27:48 发布

weixin_30429201

最新推荐文章于 2019-11-04 14:27:48 发布

阅读量44

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/GadyPu/p/5034090.html

本文探讨了如何判断一个字符串是否为回文串，忽略大小写和非字母数字字符。通过实例代码演示了实现过程。

题目连接

https://leetcode.com/problems/valid-palindrome/

Valid Palindrome

Description

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.

class Solution {
public:
	bool isPalindrome(string s) {
		ret = "";
		if (s.empty()) return true;
		int n = (int)s.length();
		for (int i = 0; i < n; i++) {
			if (isalpha(s[i]) || isdigit(s[i])) ret += tolower(s[i]);
		}
		return isOk();
	}
private:
	string ret;
	bool isOk() const {
		int i = 0, j = (int)ret.length() - 1;
		while (i < j) {
			if (ret[i] != ret[j]) return false;
			i++, j--;
		}
		return true;
	}
};

转载于:https://www.cnblogs.com/GadyPu/p/5034090.html