LeetCode) 9. Palindrome Number

Language: java

class Solution {
	public boolean isPalindrome(int x) {
        String strX = x + "";
		String[] originArr = strX.split("");
		String[] cloneArr = strX.split("");
		  for(int i = 0; i < strX.length() / 2; i++) {
		        if(!originArr[i].equals(cloneArr[strX.length()-1-i])) return false;
		    }
		
		return true;
	}
}

class Solution {
	public boolean isPalindrome(int x) {
        //음수면 무조건 false
        if(x < 0) return false;
        
        int reverse = 0;
        int cloneX = x;
        while(cloneX > 0) {
            reverse *= 10;
            reverse += cloneX % 10;
            cloneX /= 10;
        }
        
        return reverse == x;
	}
}