leetcode每日一题--雀巢原理；抽屉算法；Quorum机制；分布式应用

leetcode每日一题

539. 最小时间差

示例 1：

输入：timePoints = [“23:59”,“00:00”]
输出：1

示例 2：

输入：timePoints = [“00:00”,“23:59”,“00:00”]
输出：0

class Solution {
   
    public int findMinDifference(List<String> time) {
   

        int len = time.size();
        List<Integer> list = new ArrayList<>();
        for(int i = 0;i < time.size();i++){
   
            String temp = time.get(i).substring(0,2) + time.get(i).substring(3