Guest User

Untitled

a guest
Jun 24th, 2018
132
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.50 KB | None | 0 0
  1. import java.util.*;
  2.  
  3. public class Palindrome{
  4. Scanner sc = new Scanner(System.in);
  5. String word;
  6. int size;
  7. int i;
  8. int left;
  9. int right;
  10. char charAt;
  11.  
  12.  
  13. void initialize(){
  14. System.out.println("Give a word of which you want to know wether it is a palindrome or not.");
  15. word = sc.next();
  16. size = word.length();
  17. System.out.print(word+" - ");
  18. }
  19. boolean recursive(String Word){
  20. word = Word;
  21. return palindrome(word,0);
  22. }
  23. boolean palindrome(String Word, int i){
  24. if (i == size){
  25. System.out.print("palindrome - ");
  26. return true;
  27. } else if (word.charAt(size - i) == word.charAt(i)) {
  28. return palindrome(word, ++i);
  29. } else {
  30. System.out.print("no palindrome - ");
  31. return false;
  32. }
  33. }
  34. boolean iterative(String Word){
  35. word = Word;
  36. left = 0;
  37. right = size;
  38.  
  39. while(left < right){
  40. if (word.charAt(left) != word.charAt(right)){
  41. System.out.print("no palindrome");
  42. left++ ;
  43. right-- ;
  44. return false;
  45. }
  46. }
  47. return true;
  48. }
  49.  
  50.  
  51. void show(){
  52. initialize();
  53. recursive(word);
  54. iterative(word);
  55. }
  56. public static void main(String[] args) {
  57. new Palindrome().show();
  58.  
  59. }
  60. }
Add Comment
Please, Sign In to add comment