LeetCode 9. Palindrome Number, 回文数 ，C#

前言

本文介绍了 LeetCode 第 9 题 , “Palindrome Number”, 也就是 “回文数” 的问题.

本文使用 C# 语言完成题目，介绍了2种方法供大家参考。

题目

English

LeetCode 9. Palindrome Number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true
Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
Follow up:

Coud you solve it without converting the integer to a string?

中文

LeetCode 9. 回文数

判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。