算法入门打卡day2

1672. 最富有客户的资产总量

int maximumWealth(int** accounts, int accountsSize, int* accountsColSize){
    int max = 0,sum = 0;
    for(int i = 0;i < accountsSize;i++){
        for(int j = 0;j < accountsColSize[i];j++){
            sum += accounts[i][j];
        }
        max = max > sum ? max : sum;
        sum = 0;    //注意算完一次之后要清零sum
    }
    return max;
}

1. 两数之和

int* twoSum(int* nums, int numsSize, int target, int* returnSize){
     int *arr= malloc(sizeof(int) * 2);
    for(int i=0;i<numsSize;i++)
    {
        for(int j=i+1;j<numsSize;j++)
        {
            if(nums[i]+nums[j]==target)
            { 
              
               arr[0]=i;
               arr[1]=j;
               *returnSize = 2;
               return arr;
            }
        }
    } 
    *returnSize = 0;
    return NULL;
}

461. 汉明距离

int hammingDistance(int x, int y) {
    int s = x ^ y, ret = 0;
    while (s) {
        ret += s & 1;
        s >>= 1;
    }
    return ret;
}