2018/111 회문(palindrome) public class Palindrome { public static boolean isPalindrome(String word) { char[] wordArr = word.toLowerCase().toCharArray(); int end = wordArr.length - 1; int mid = wordArr.length / 2; for (int i = 0; i < mid; i++) { if (wordArr[i] != wordArr[end - i]) return false; } return true; } public static void main(String[] args) { System.out.println(Palindrome.isPalindrome("Deleveled")); // level(true.. 2018. 11. 26. 이전 1 다음 반응형