Leetcode 判断字符串是否能翻转

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
相关文章
相关标签/搜索