LeetCode-035. 最小时间差

 

class Solution {
    public int findMinDifference(List<String> timePoints) {
        // 字符串-排序，最小时间差=相邻/首尾差
        if(timePoints.size()>1440){
            return 0;
        }
        Collections.sort(timePoints);
        int ans = Integer.MAX_VALUE;
        int t0 = getMinutes(timePoints.get(0));
        int pre = t0;
        for (int i = 1; i < timePoints.size(); i++) {
            int t = getMinutes(timePoints.get(i));
            ans = Math.min(ans,t-pre);
            pre=t;
        }
        ans = Math.min(ans,1440+t0-pre );
        return ans;
    }
    public int getMinutes(String time) {
        return ((time.charAt(0)-'0')*10+(time.charAt(1)-'0'))*60+(time.charAt(3)-'0')*10+(time.charAt(4)-'0');
    }
}