leetcode::minimum_time_difference::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	findMinDifference (vector< string > &timePoints)

详细描述

在文件 leetcode.h 第 523 行定义.

成员函数说明

findMinDifference()

int leetcode::minimum_time_difference::Solution::findMinDifference ( vector< string > &  timePoints )

static

在文件 leetcode.cpp 第 1142 行定义.

                                                                  {
            auto vec = vector<int>();
            for(string timePoint: timePoints) {
                vec.push_back(((timePoint[0] - '0') * 10 + (timePoint[1] - '0')) * 60 + (timePoint[3] - '0') * 10 + (timePoint[4] - '0'));
            }
            sort(vec.begin(), vec.end());
            int minimum = INT_MAX;
            for(int i = 0; i + 1 < vec.size(); i++) {
                minimum = min(minimum, vec[i + 1] - vec[i]);
            }
            minimum = min(minimum, vec[0] + 24 * 60 - vec[vec.size() - 1]);
            return minimum;
        }

引用了 pat::a::a7_2::vec.

被这些函数引用 leetcode::minimum_time_difference::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp