摘要：
bool isPalindrome(int x){ if (x < 0) return false; int num = x; int arr[10] = {0}; int index = 0; while(num!=0) { arr[index] = num % 10; num /= 10; in 阅读全文
摘要：
/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target, int* returnSize){ //i 阅读全文
摘要：
int reverse(int x){ int arr[32] = {0}; int bit = 0; long long Integer = 0; while(x) { arr[bit] = x % 10; x = x / 10; bit++; } int Loopbit = bit; bit - 阅读全文