力扣周赛：删除每行最大值，数组中最长的方波

 

 

 

int cmp(void const*a,void const*b){
    return (*(int*)a-*(int*)b);//将数组从小到大排序
}
int deleteGreatestValue(int**grid,int gridSize,int*gridColSize){
    int m=gridSize;
    int n=gridColSize[0];
    int sum=0;
    for(int i=0;i<m;i++){//对每行进行排序
        qsort(grid[i],n,sizeof(int),cmp);
    }
    for(int i=0;i<n;i++){//对每列进行寻找最大值
        int max=0;
        for(int j=0;j<m;j++){
            if(max<grid[j][i]){
               max=grid[j][i];
             }
        }
        sum+=max;//返回最大值
    }
    return sum;//返回累加值
}

 

 

int cmp(const void *a,const void *b)
{
   return *(int*)a-*(int*)b;//从小到大排序
}
int bin_sch(int *nums,int nusSize,int low,long val)
{
   int high=numsSize-1;//high表示数组大小
   while(low<=high)
   {
      int mid=(low+high)/2;//二分查找
      if(nums[mid]==val)
         return mid;
      else if(nums[mid]>val)
         high=mid-1;
      else
         low=mid+1;
   }
   return -1;
}
int longestSquareStreak(int* nums, int numsSize){
    int res=-1;//默认为-1
    qsort(nums,numsSize,sizeof(int),cmp);
    for(int i=0;i<numsSize;i++)
    {
        int last=i,count=0;
        while(last!=-1)
        {
            count++;
            last=bin_sch(nums,numsSize,last,(long)nums[last]*nums[last]);
        }
        res=fmax(res,count);//快速比较
    }
    return res==1?-1:res;
}