FilesExpand file tree

 master

/

Palindrome.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

64 lines (56 loc) · 1.74 KB

 master

/

Palindrome.java

Top

File metadata and controls

• Code
• Blame

64 lines (56 loc) · 1.74 KB

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

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

package strings;

/** Wikipedia: https://en.wikipedia.org/wiki/Palindrome */

class Palindrome {

/** Driver Code */

public static void main(String[] args) {

String[] palindromes = {null, "", "aba", "123321"};

for (String s : palindromes) {

assert isPalindrome(s) && isPalindromeRecursion(s) && isPalindrome1(s);

}

String[] notPalindromes = {"abb", "abc", "abc123"};

for (String s : notPalindromes) {

assert !isPalindrome(s) && !isPalindromeRecursion(s) && !isPalindrome1(s);

}

}

/**

* Check if a string is palindrome string or not

*

* @param s a string to check

* @return {@code true} if given string is palindrome, otherwise {@code false}

*/

public static boolean isPalindrome(String s) {

return (s == null || s.length() <= 1) || s.equals(new StringBuilder(s).reverse().toString());

}

/**

* Check if a string is palindrome string or not using recursion

*

* @param s a string to check

* @return {@code true} if given string is palindrome, otherwise {@code false}

*/

public static boolean isPalindromeRecursion(String s) {

if (s == null || s.length() <= 1) {

return true;

}

if (s.charAt(0) != s.charAt(s.length() - 1)) {

return false;

}

return isPalindrome(s.substring(1, s.length() - 1));

}

/**

* Check if a string is palindrome string or not another way

*

* @param s a string to check

* @return {@code true} if given string is palindrome, otherwise {@code false}

*/

public static boolean isPalindrome1(String s) {

if (s == null || s.length() <= 1) {

return true;

}

for (int i = 0, j = s.length() - 1; i < j; ++i, --j) {

if (s.charAt(i) != s.charAt(j)) {

return false;

}

}

return true;

}

}