day 44

3028.边界上的蚂蚁

int returnToBoundaryCount(int* nums, int numsSize) {
    int x=0,t=0;
    for(int i=0;i<numsSize;i++){
        x+=nums[i];
        if(x==0){
            t++;
        }
    }
    return t;
}

1732.找到最高海拔

int largestAltitude(int* gain, int gainSize) {
    int x=0,max=0;
    for(int i=0;i<gainSize;i++){
        x+=gain[i];
        if(x>max){
            max=x;
        }
    }
    return max;
}