剑指 Offer II 035. 最小时间差-快速排序加数据转换

剑指 Offer II 035. 最小时间差-快速排序加数据转换

给定一个 24 小时制（小时:分钟 “HH:MM”）的时间列表，找出列表中任意两个时间的最小时间差并以分钟数表示。

示例 1：

输入：timePoints = [“23:59”,“00:00”]
输出：1

示例 2：

输入：timePoints = [“00:00”,“23:59”,“00:00”]
输出：0

解题代码如下：

void quick(int *a,int low,int high){
    if(low<high){
    //    printf("**%d ",a[low]);
        int l=low,h=high,p=a[low];
        while(low<high){
            while(low<high&&a[high]>=p){
                high--;
            }
            a[low]=a[high];
            while(low<high&&a[low]<=p){
                low++;
            }
            a[high]=a[low];
        }
        a[low]=p;
        quick(a,l,low-1);
        quick(a,low+1,h);
    }
}

int findMinDifference(char ** timePoints, int timePointsSize){
    int  *a=(int *)malloc(sizeof(int )*timePointsSize);
    int i;
    for(i=0;i<timePointsSize;i++){

        char *s=timePoints[i];
     //   printf("%s ",s);
        int z=0;
        int j=0;
        while(s[j]!=':'){
            z=z*10+s[j]-'0';
            j++;
        }
        int b=0;
        j++;
      
        while(s[j]!='\0'){
            b=b*10+s[j]-'0';
            j++;
        }
        a[i]=z*60+b;
    //    printf("%d %d %d ",a[i],z,b);
         
    }
    quick(a,0,timePointsSize-1);

    int min=10000;
     int t=fmin(a[timePointsSize-1]-a[0],1440-a[timePointsSize-1]+a[0]);
    if(t<min){
            min=t;
        }
    for(i=1;i<timePointsSize;i++){
     //   printf("-%d ",a[i]);
        int t=fmin(a[i]-a[i-1],1440-a[i]+a[i-1]);
        if(t<min){
            min=t;
        }
    }



return min;
}