forked from sachuverma/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValid Palindrome.cpp
More file actions
42 lines (35 loc) · 769 Bytes
/
Valid Palindrome.cpp
File metadata and controls
42 lines (35 loc) · 769 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/*
Valid Palindrome
================
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Note: For the purpose of this problem, we define empty string as valid palindrome.
Example 1:
Input: "A man, a plan, a canal: Panama"
Output: true
Example 2:
Input: "race a car"
Output: false
Constraints:
s consists only of printable ASCII characters.
*/
class Solution
{
public:
bool isPalindrome(string s)
{
int start = 0, end = s.length() - 1;
while (start < end)
{
if (!isalnum(s[start]))
start++;
else if (!isalnum(s[end]))
end--;
else
{
if (tolower(s[start++]) != tolower(s[end--]))
return false;
}
}
return true;
}
};