Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 539. Minimum Time Difference

---

題目：


解答：

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        int n = timePoints.size();
        vector<int> mm;

        for (string s : timePoints) {
            int h = stoi(s.substr(0, 2));
            int m = stoi(s.substr(3, 2));

            mm.push_back(h * 60 + m);
        }

        int mn = INT_MAX;
        sort(mm.begin(), mm.end());

        for (int i = 1; i < mm.size(); ++i) {
            mn = min(mn, mm[i] - mm[i - 1]);
        }

        mn = min(mn, 1440 - mm.back() + mm.front());

        return mn;
    }
};