Solve one Leetcode Problem

Author: AV1004

5_Basic_Recursion/intro.cpp

@@ -163,6 +163,34 @@ int fibonacciOfN(int n)
     return fibonacciOfN(n - 1) + fibonacciOfN(n - 2);
 }
 
+// Leetcode 125. Valid Palindrome
+bool isPalindrome(string s)
+{
+    int start = 0;
+    int end = s.size() - 1;
+    while (start <= end)
+    {
+        if (!isalnum(s[start]))
+        {
+            start++;
+            continue;
+        }
+        if (!isalnum(s[end]))
+        {
+            end--;
+            continue;
+        }
+        if (tolower(s[start]) != tolower(s[end]))
+            return false;
+        else
+        {
+            start++;
+            end--;
+        }
+    }
+    return true;
+}
+
 int main()
 {
     int n;