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) {
        vector<int> m;
        string s;
        int cur;
        for(int i = 0;i < timePoints.size();i++){
            cur = 60*((timePoints[i][0]-'0')*10+(timePoints[i][1]-'0'))+ (timePoints[i][3]-'0')*10+(timePoints[i][4]-'0');
            m.push_back(cur);
        }
        sort(m.begin(),m.end());
        int minv=200000;
        for(int i = 0;i < m.size()-1;i++){
            minv = min(minv,m[i+1]-m[i]);
        }
        minv =min(minv,1440-m[m.size()-1]+m[0]);
        return minv;
    }
};
17700