既有适合小白学习的零基础资料,也有适合3年以上经验的小伙伴深入学习提升的进阶课程,涵盖了95%以上Go语言开发知识点,真正体系化!
由于文件比较多,这里只是将部分目录截图出来,全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频,并且后续会持续更新
### 题解
**C++**
class Solution {
int getMinutes(string &t) {
return (int(t[0] - ‘0’) * 10 + int(t[1] - ‘0’)) * 60 + int(t[3] - ‘0’) * 10 + int(t[4] - ‘0’);
}
public:
int findMinDifference(vector &timePoints) {
sort(timePoints.begin(), timePoints.end());
int ans = INT_MAX;
int t0Minutes = getMinutes(timePoints[0]);
int preMinutes = t0Minutes;
for (int i = 1; i < timePoints.size(); ++i) {
int minutes = getMinutes(timePoints[i]);
ans = min(ans, minutes - preMinutes); // 相邻时间的时间差
preMinutes = minutes;
}
ans = min(ans, t0Minutes + 1440 - preMinutes); // 首尾时间的时间差
return ans;
}
};
注意怎么根据 24 小时制(小时:分钟 **“HH:MM”**)的时间列表这个字符串来获得整型时间。
**C**
#define MIN(a, b) ((a) < (b) ? (a) : (b))
int getMinutes(const char * t) {
return ((t[0] - ‘0’) * 10 + (t[1] - ‘0’)) * 60 + (t[3] - ‘0’) * 10 + (t[4] - ‘0’);
}
int cmp(const void * pa, const void * pb) {
return strcmp(*(char **)pa, *(char **)pb);
}
int findMinDifference(char ** timePoints, int timePointsSize) {
qsort(timePoints, timePointsSize, sizeof(char *), cmp);
int ans = 1440;
int t0Minutes = getMinutes(timePoints[0]);
int preMinutes = t0Minutes;
for (int i = 1; i < timePointsSize; ++i) {
int minutes = getMinutes(timePoints[i]);
ans = MIN(ans, minutes - preMinutes); // 相邻时间的时间差
preMinutes = minutes;
}
ans = MIN(ans, t0Minutes + 1440 - preMinutes); // 首尾时间的时间差
return ans;
}
**Java**
class Solution {
public int findMinDifference(List timePoints) {
既有适合小白学习的零基础资料,也有适合3年以上经验的小伙伴深入学习提升的进阶课程,涵盖了95%以上Go语言开发知识点,真正体系化!
由于文件比较多,这里只是将部分目录截图出来,全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频,并且后续会持续更新
讲义、实战项目、大纲路线、讲解视频,并且后续会持续更新**