LeetCode之Palindrome Number（回文数）

  public static boolean isPalindrome(int x) {
    if (x < 0) {
      return false;
    }
    String s = String.valueOf(x);
    char[] chars = s.toCharArray();
    int length = chars.length;
    for (int i = 0 ; i < length / 2; ++i) {
      if (chars[i] != chars[length - i -1]) {
        return false;
      }
    }
    return  true;
  } 

  public static boolean isPalindrome1(int x) {
    if (x < 0) {
      return false;
    }
    String s = String.valueOf(x);
    char[] chars = s.toCharArray();
    int start = 0;
    int end = chars.length - 1;
    while (start < end) {
      if (chars[start++] != chars[end--]) {
        return false;
      }
    }
    return true;
  }