leetcode 539. Minimum Time Difference

题目：

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

思路：

转化成int再用set存储，计算即可。

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        set<int> re;
        for(int i = 0; i < timePoints.size(); i++) {
            int tmp = (timePoints[i][0]-'0')*10+(timePoints[i][1]-'0');
            int tmp2 = (timePoints[i][3]-'0')*10+(timePoints[i][4]-'0');
            if(re.find(tmp*60+tmp2)!=re.end()) {
                return 0;
            } else {
                re.insert(tmp*60+tmp2);
            }
        }
        int result = 23*60+59;
        set<int>::iterator it = re.begin();
        int tmp = *it;
        it++;
        while(1) {
            if(*it - tmp < result) result = *it - tmp;
			tmp = *it++;
			if(it == re.end()) break;
        }
        return result<*re.begin()-0+24*60-*re.rbegin()?result:*re.begin()-0+24*60-*re.rbegin();
    }
};