
给定一个 24 小时制(小时:分钟 “HH:MM”)的时间列表,找出列表中任意两个时间的最小时间差并以分钟数表示。
示例 1:
输入:timePoints = [“23:59”,“00:00”]
输出:1
示例 2:
输入:timePoints = [“00:00”,“23:59”,“00:00”]
输出:0
提示:
2 <= timePoints <= 2 * 104
timePoints[i] 格式为 “HH:MM”
public int findMinDifference(ListtimePoints) { int i=0; int len =timePoints.size(); int[] a=new int[len]; for (String timePoint : timePoints) { String[] split = timePoint.split(":"); a[i]=Integer.parseInt(split[0])*60+Integer.parseInt(split[1]); i++; } Arrays.sort(a); int min=Integer.MAX_VALUE; for (i = 1; i < len; i++) { min=Math.min(a[i]-a[i-1],min); } return Math.min(24*60+a[0]-a[len-1],min); }
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)