539. Minimum Time Difference

35 篇文章 0 订阅
Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum  minutes  difference between any two time points in the list.

Example 1:

Input: ["23:59","00:00"]
Output: 1

Note:

  1. The number of time points in the given list is at least 2 and won't exceed 20000.

  1. The input time is legal and ranges from 00:00 to 23:59.


代码如下:

class Solution {
        public int findMinDifference(List<String> timePoints) {
            int mm = Integer.MAX_VALUE;
            List<Integer> list = new ArrayList<>();

            for(String str : timePoints){
                int hour = Integer.valueOf(str.substring(0, 2));
                int minute = Integer.valueOf(str.substring(3, 5));
                list.add(hour * 60 + minute);
            }

            Collections.sort(list, (Integer a, Integer b) -> a - b);

            for(int i = 1; i < list.size(); i++)
                mm = Math.min(mm, list.get(i) - list.get(i-1));

            return Math.min(mm, list.get(0) + 1440 - list.get(list.size()-1));
        }
    }

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值