Given a list of 24-hour clock time points in <strong>&quot;HH:MM&quot;</strong> format, return <em>the minimum <b>minutes</b> difference between any two time-points in the list</em>.
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> timePoints = ["23:59","00:00"]
<strong>Output:</strong> 1
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> timePoints = ["00:00","23:59","00:00"]
<strong>Output:</strong> 0
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= timePoints.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>timePoints[i]</code> is in the format <strong>&quot;HH:MM&quot;</strong>.</li>
</ul>

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        constexpr int kMaxTimePoints{24*60};
        vector<bool> occurred(kMaxTimePoints, false);
        for (const string &t : timePoints) {
            int hour = stoi(t.substr(0, 2));
            int minute = stoi(t.substr(3, 2));
            int moment = 60 * hour + minute;
            if (occurred[moment]) return 0;
            occurred[moment] = true;
        }
        int res{INT_MAX};
        int first{0}, last{kMaxTimePoints-1};
        while (first < kMaxTimePoints) {
            if (occurred[first]) break;
            ++first;
        }
        while (last > first) {
            if (occurred[last]) break;
            --last;
        }
        int pre{first};
        for (int i = first + 1; i <= last; ++i) {
            if (occurred[i]) {
                res = min(res, i - pre);
                pre = i;
            }
        }
        // cout << "first = " << first << ", last = " << last << endl;
        return min(res, kMaxTimePoints + first - last);
    }
};
17100