intreverse(int x){longint num=0;while(x){
num =10*num +x%10;if(num > INT_MAX || num < INT_MIN)return0;
x=x/10;}return num;}
回文数
bool isPalindrome(int x){if(x <0)return false;int div =1;while(x / div >=10){
div *=10;}while(x !=0){int l = x / div;int r = x %10;if(l != r)return false;
x =(x % div)/10;//去掉两边的数
div /=100;}return true;}
只出现过一次的数字
intsingleNumber(int* nums,int numsSize){int i, t=0;for(i=0; i<numsSize;i++){
t ^= nums[i];//利用异或的方法}return t;}//多数元素intmajorityElement(int* nums,int numsSize){int count =1;int maj = nums[0];for(int i =1; i < numsSize; i++){if(maj == nums[i])
count++;else{
count--;if(count ==0){
maj = nums[i +1];}}}return maj;}