Leetcode OJ Contest23 Minimum Time Difference_Leetcode539
来源:互联网 发布:淘宝收藏大师怎么设置 编辑:程序博客网 时间:2024/06/06 15:48
//cpp. Leetcode OJ Contest23 Minimum Time Difference_Leetcode539
//source code
class Solution {
public:
int findMinDifference(vector<string>& timePoints) {
sort(timePoints.begin(),timePoints.end());
int min_time=1440,n=timePoints.size();
for(int i=0;i<timePoints.size();i++){
if(Time_abs(timePoints[i],timePoints[(i+1)%n])<min_time)
min_time=Time_abs(timePoints[i],timePoints[(i+1)%n]);
}
return min_time;
}
private:
int Time_abs(string s1,string s2){
int h1=stoi(s1.substr(0,2)); //截取小时,下同理
int h2=stoi(s2.substr(0,2));
int m1=stoi(s1.substr(3,2));
int m2=stoi(s2.substr(3,2));
int time=abs((h2-h1)*60+(m2-m1));
return min(time,1440-time);
}
};
- Leetcode OJ Contest23 Minimum Time Difference_Leetcode539
- Leetcode OJ Contest23 Reverse String II_Leetcode541
- leetcode 539. Minimum Time Difference
- Leetcode-539. Minimum Time Difference
- [leetcode] 539. Minimum Time Difference
- 【LeetCode 539】 Minimum Time Difference
- [LeetCode]539. Minimum Time Difference
- LeetCode 539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode 539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode:539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode OJ:Minimum Window Substring
- LeetCode OJ:Minimum Path Sum
- LeetCode OJ - Minimum Path Sum
- LeetCode OJ - Minimum Window Substring
- LeetCode OJ Minimum Path Sum
- IOS用CGContextRef画各种图形(文字、圆、直线、弧线、矩形、扇形、椭圆、三角形、圆角矩形、贝塞尔曲线、图片)
- JVM学习之类加载
- 解决Exception in thread "http-bio-8080-exec-2" java.lang.OutOfMemoryError: PermGen space
- 三天打鱼两天晒网问题C++版本
- 情感分类--example
- Leetcode OJ Contest23 Minimum Time Difference_Leetcode539
- 浅克隆与深克隆
- Android中关于bean类的总结
- 《ACM程序设计》书中题目 K-11 build a wall
- 九度 oj 题目1548:平面上的点
- 单链表面试题(2)
- Qt C++发送图片到QML显示
- Python 包管理工具
- PE格式详解讲解1