fix: update cpp solution in lc/lcof2 problem and close #588

lc&lcof2 problem: Minimum Time Difference

Author: yanglbme

lcof2/剑指 Offer II 035. 最小时间差/README.md

@@ -35,7 +35,6 @@
 
 <p><meta charset="UTF-8" />注意：本题与主站 539&nbsp;题相同：&nbsp;<a href="https://leetcode-cn.com/problems/minimum-time-difference/">https://leetcode-cn.com/problems/minimum-time-difference/</a></p>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -95,24 +94,21 @@ class Solution {
 
 ```cpp
 class Solution {
-    public int findMinDifference(List<String> timePoints) {
-        if (timePoints.size() > 24 * 60) {
+public:
+    int findMinDifference(vector<string> &timePoints) {
+        if (timePoints.size() > 24 * 60)
             return 0;
-        }
-        List<Integer> mins = new ArrayList<>();
-        for (String t : timePoints) {
-            String[] time = t.split(":");
-            mins.add(Integer.parseInt(time[0]) * 60 + Integer.parseInt(time[1]));
-        }
-        Collections.sort(mins);
-        mins.add(mins.get(0) + 24 * 60);
+        vector<int> mins;
+        for (auto t : timePoints)
+            mins.push_back(stoi(t.substr(0, 2)) * 60 + stoi(t.substr(3)));
+        sort(mins.begin(), mins.end());
+        mins.push_back(mins[0] + 24 * 60);
         int res = 24 * 60;
-        for (int i = 1; i < mins.size(); ++i) {
-            res = Math.min(res, mins.get(i) - mins.get(i - 1));
-        }
+        for (int i = 1; i < mins.size(); ++i)
+            res = min(res, mins[i] - mins[i - 1]);
         return res;
     }
-}
+};
 ```
 
 ### **Go**

solution/0500-0599/0539.Minimum Time Difference/README.md

@@ -92,24 +92,21 @@ class Solution {
 
 ```cpp
 class Solution {
-    public int findMinDifference(List<String> timePoints) {
-        if (timePoints.size() > 24 * 60) {
+public:
+    int findMinDifference(vector<string> &timePoints) {
+        if (timePoints.size() > 24 * 60)
             return 0;
-        }
-        List<Integer> mins = new ArrayList<>();
-        for (String t : timePoints) {
-            String[] time = t.split(":");
-            mins.add(Integer.parseInt(time[0]) * 60 + Integer.parseInt(time[1]));
-        }
-        Collections.sort(mins);
-        mins.add(mins.get(0) + 24 * 60);
+        vector<int> mins;
+        for (auto t : timePoints)
+            mins.push_back(stoi(t.substr(0, 2)) * 60 + stoi(t.substr(3)));
+        sort(mins.begin(), mins.end());
+        mins.push_back(mins[0] + 24 * 60);
         int res = 24 * 60;
-        for (int i = 1; i < mins.size(); ++i) {
-            res = Math.min(res, mins.get(i) - mins.get(i - 1));
-        }
+        for (int i = 1; i < mins.size(); ++i)
+            res = min(res, mins[i] - mins[i - 1]);
         return res;
     }
-}
+};
 ```
 
 ### **Go**

solution/0500-0599/0539.Minimum Time Difference/README_EN.md

@@ -29,7 +29,6 @@ Given a list of 24-hour clock time points in <strong>&quot;HH:MM&quot;</strong>
 3. Push the time `mins[0] + 24 * 60` to deal with min and max diff.
 4. For each value in `mins[1:]`, calculate the min diff `mins[i] - mins[i - 1]`.
 
-
 <!-- tabs:start -->
 
 ### **Python3**
@@ -75,24 +74,21 @@ class Solution {
 
 ```cpp
 class Solution {
-    public int findMinDifference(List<String> timePoints) {
-        if (timePoints.size() > 24 * 60) {
+public:
+    int findMinDifference(vector<string> &timePoints) {
+        if (timePoints.size() > 24 * 60)
             return 0;
-        }
-        List<Integer> mins = new ArrayList<>();
-        for (String t : timePoints) {
-            String[] time = t.split(":");
-            mins.add(Integer.parseInt(time[0]) * 60 + Integer.parseInt(time[1]));
-        }
-        Collections.sort(mins);
-        mins.add(mins.get(0) + 24 * 60);
+        vector<int> mins;
+        for (auto t : timePoints)
+            mins.push_back(stoi(t.substr(0, 2)) * 60 + stoi(t.substr(3)));
+        sort(mins.begin(), mins.end());
+        mins.push_back(mins[0] + 24 * 60);
         int res = 24 * 60;
-        for (int i = 1; i < mins.size(); ++i) {
-            res = Math.min(res, mins.get(i) - mins.get(i - 1));
-        }
+        for (int i = 1; i < mins.size(); ++i)
+            res = min(res, mins[i] - mins[i - 1]);
         return res;
     }
-}
+};
 ```
 
 ### **Go**