-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathValid Palindrome
50 lines (36 loc) · 1.03 KB
/
Valid Palindrome
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
Problem :
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.
Solution :C#
public class Solution {
public bool IsPalindrome(string s) {
if(string.IsNullOrEmpty(s))
return true;
if(s.Length==1)
return true;
int f=0,sec=s.Length-1;
while(f<sec){
while(f<sec && !Char.IsLetterOrDigit(s[f]))f++;
while(f<sec && !Char.IsLetterOrDigit(s[sec]))sec--;
if(f>=sec)
{
return true;
}
if(!char.ToLower(s[f]).Equals(char.ToLower(s[sec])))
{
return false;
}
f++;
sec--;
}
return true;
}
}