-Code
class Solution {
public boolean isPalindrome(int x) {
String xString = String.valueOf(x);
int xLen = xString.length();
for (int i = 0; i < xLen; i++) {
if (xString.charAt(i) != xString.charAt(xLen - i - 1)) {
return false;
}
}
return true;
}
}
'Beakjoon&프로그래머스 > Java' 카테고리의 다른 글
[LeetCode/Java] 383. Ransom Note (1) | 2025.06.10 |
---|---|
[LeetCode/Java] 876. Middle of the Linked List (0) | 2025.06.10 |
[LeetCode/Java] 1342. Number of Steps to Reduce a Number to Zero (0) | 2025.06.10 |
[LeetCode/Java] 412. Fizz Buzz (0) | 2025.06.10 |
[LeetCode/Java] 1672. Richest Customer Wealth (0) | 2025.06.10 |