FilesExpand file tree

 master

/

125.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (34 loc) · 672 Bytes

 master

/

125.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (34 loc) · 672 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include "stdafx.h"

/*

给定一个字符串，验证它是否是回文串，只考虑字母和数字字符，可以忽略字母的大小写。

说明：本题中，我们将空字符串定义为有效的回文串。

示例 1:

输入: "A man, a plan, a canal: Panama"

输出: true

示例 2:

输入: "race a car"

输出: false

*/

class Solution {

public:

bool isPalindrome(string s) {

string tmp = "";

for (int i = 0;i<s.size();i++)

{

if (isdigit(s[i]))

tmp += s[i];

else if (isupper(s[i]))

tmp += s[i] - 'A' + 'a';

else if (islower(s[i]))

tmp += s[i];

}

if (tmp.size() <= 1) return true;

int i = 0, j = tmp.size() - 1;

while (i<j)

{

if (tmp[i++] != tmp[j--])

return false;

}

return true;

}

};