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 TFH = 1440;
    int findMinDifference(vector<string>& timePoints) {
        vector<int> v;
        for (string str : timePoints) {
            int time = p(str[0])*600+p(str[1])*60+p(str[3])*10+p(str[4]);
            v.push_back(time); v.push_back(time+TFH);
        }
        sort(v.begin(), v.end());

        int ret = 2e5;
        for (int i = 1; i < v.size(); i++) {
            ret = min(ret, v[i]-v[i-1]);
        }

        return ret;
    }

    int p(char c) {
        return c-'0';
    }
};
17800