zchunle的博客

Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the sam

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 需要考虑的点是int类型的范围是-2147483648~2147483648.可能会出现溢出状况 ，这里使用longlong类型避免这种情况 class Solution { public:

Determine whether an integer is a palindrome. Do this without extra space. 回文就是左右颠倒之后还是一样的。不能用reverse integer的方法 ，可能会造成溢出的情况。使用除法和取余的方法。 class Solution { public: bool isPalindrome(int x) {