-
Notifications
You must be signed in to change notification settings - Fork 0
/
32_valid-palindrome.cpp
62 lines (52 loc) · 1.36 KB
/
32_valid-palindrome.cpp
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// DATE: 05-Aug-2023
/* PROGRAM: 32_String - Valid Palindrome
https://leetcode.com/problems/valid-palindrome/
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and
removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric
characters include letters and numbers.
Given a string s, return true if it is a palindrome, or false otherwise.
Example 1:
Input: s = "A man, a plan, a canal: Panama"
Output: true
Explanation: "amanaplanacanalpanama" is a palindrome.
Example 2:
Input: s = "race a car"
Output: false
Explanation: "raceacar" is not a palindrome.
Example 3:
Input: s = " "
Output: true
Explanation: s is an empty string "" after removing non-alphanumeric characters.
Since an empty string reads the same forward and backward, it is a palindrome.
*/
// @ankitsamaddar @Aug_2023
#include <ios>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution {
public:
bool isPalindrome(string s) {
int i = 0;
int j = s.size() - 1;
while (i < j) {
if (!iswalnum(s[i])) {
i++;
} else if (!iswalnum(s[j])) {
j--;
} else {
if (tolower(s[i]) != tolower(s[j])) return false;
i++;
j--;
}
}
return true;
}
};
int main() {
string s = "A man, a plan, a canal: Panama";
Solution sol;
cout<<boolalpha<<sol.isPalindrome(s);
return 0;
}