给定一个 24 小时制(小时:分钟)的时间列表,找出列表中任意两个时间的最小时间差并已分钟数表示。
示例 1:
输入: ["23:59","00:00"]
输出: 1
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-time-difference
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
写了种解法,超出时间限制,先记录下,下面继续改进
class Solution {
public int findMinDifference(List<String> timePoints) {
int minTime=0;
int time=0;
ArrayList<Integer> timeInt=new ArrayList<Integer>();
for(int i=0;i<timePoints.size();i++) {
time= toTime(timePoints.get(i));
timeInt.add(time);
}
minTime=Math.abs(timeInt.get(0)-timeInt.get(1));
int linshi=0;
for(int i=0;i<timeInt.size();i++) {
for(int n=i+1;n<timeInt.size();n++) {
linshi=Math.abs(timeInt.get(i)-timeInt.get(n));
if(linshi>720) {
linshi=1440-linshi;
}
minTime=linshi<minTime?linshi:minTime;
}
}
return minTime;
}
public static int toTime(String time) {
int mi=0;
mi=Integer.parseInt(time.split(":")[0])*60+Integer.parseInt(time.split(":")[1]);
return mi;
}
}
百度找到个方法Arrays.sort()用来给数组排序,用法参考
https://blog.csdn.net/github_38838414/article/details/80642329
class Solution {
public int findMinDifference(List<String> timePoints) {
int minTime=0;
int[] timeInt=new int[timePoints.size()];
for(int i=0;i<timePoints.size();i++) {
timeInt[i]= toTime(timePoints.get(i));
}
Arrays.sort(timeInt);
minTime=Math.abs(timeInt[0]-timeInt[timePoints.size()-1]);
minTime=minTime<720?minTime:1440-minTime;
int tim=0;
for(int i=0;i<timePoints.size()-1;i++) {
tim=Math.abs(timeInt[i]-timeInt[i+1])<720?Math.abs(timeInt[i]-timeInt[i+1]):1440-Math.abs(timeInt[i]-timeInt[i+1]);
//System.out.println(" "+(Math.abs(timeInt[i]-timeInt[i+1])<720)+" "+timeInt[i]+" -"+timeInt[i+1]);
minTime=tim<minTime?tim:minTime;
}
return minTime;
}
public static int toTime(String time) {
int mi=0;
mi=Integer.parseInt(time.split(":")[0])*60+Integer.parseInt(time.split(":")[1]);
return mi;
}
}
分析思路