C language practice (IX)

1. Given an array of integers nums And an integer target value target, Please find... In the array And is the target value target the Two Integers , And return their array subscripts

Method 1 : Two level loop traversal

int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    
    int i,j;
    for(i=0;i<numsSize;i++){
    
        for(j=i+1;j<numsSize;j++){
    
            if(nums[i] + nums[j] == target){
       // find 
                int *new = (int *)malloc(2*sizeof(int));
                new[0]=i;
                new[j]=j;
                *returnSize = 2;
                return new;
            }
        }
    }
    // There is no answer 
    *returnSize = 0;
    return NULL;
}

2. Give you an integer x , If x Is a palindrome integer , return true ; otherwise , return false

Palindrome number refers to positive order （ From left to right ） Reverse order （ From right to left ） Read all the same integers .

for example ,121 It's palindrome. , and 123 No .

bool isPalindrome(int x){
    
    if(x<0 || x%10 ==0 && x!=0)   // with  '-', Or ending with 0
        return false;
    else{
    
        int revertNumber = 0;
        while(x>revertNumber){
    
            revertNumber = revertNumber*10+x%10;
            x /= 10;
        }
        return x==revertNumber || x==revertNumber/10;
    }
}