数组最后一个元素与第一个元素比较以及stoi函数

539. Minimum Time Difference

Medium

25388FavoriteShare

Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list.

Example 1:

Input: ["23:59","00:00"]
Output: 1

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        int Result = 1440;
        int Size = timePoints.size();
        sort(timePoints.begin(),timePoints.end());
        for(int i = 0;i < Size;i ++){
            int tmp = Diff(timePoints[i],timePoints[(i + 1) % Size]);
            int TmpResult = min(1440 - tmp,tmp);
            Result = min(Result,TmpResult);
        }
        return Result;
    }
    int Diff(string time1,string time2){
        string h1 = time1.substr(0,2);
        string m1 = time1.substr(3,2);
        string h2 = time2.substr(0,2);
        string m2 = time2.substr(3,2);
        int hour1 = stoi(h1);
        int hour2 = stoi(h2);
        int minute1 = stoi(m1);
        int minute2 = stoi(m2);
        int Res = abs((hour2 - hour1) * 60 + (minute2 - minute1));
        return Res;
    }
};