码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode--539. Minimum Time Difference

时间:2018-05-06 16:18:15      阅读:183      评论:0      收藏:0      [点我收藏+]

标签:minutes   amp   minimum   ice   get   tco   max   find   imu   

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"]
const MaxMinute = 24 * 60

func findMinDifference(slice1 []string) int {
    min := MaxMinute

    ts := make([]int, 2*MaxMinute)
    for _, v := range slice1 {
        ts[getMinute(v)] ++
        if ts[getMinute(v)]==2{
            return 0
        }
        ts[getMinute(v)+MaxMinute]++
    }


    front, rear := 0, 0
    for front < MaxMinute*2 {
        if front == rear || ts[front] == 0 {
            front++
            continue
        }
        if ts[rear] == 0 {
            rear++
            continue
        }

        if min > front-rear {
            min = front - rear
        }
        rear = front
        front ++
    }

    return min
}

func getMinute(timestr string) int {
        return ((int(timestr[0]-0))*10+int(timestr[1]-0))*60+(int(timestr[3]-0))*10+int(timestr[4]-0)
}

 


Output: 1

 

leetcode--539. Minimum Time Difference

标签:minutes   amp   minimum   ice   get   tco   max   find   imu   

原文地址:https://www.cnblogs.com/fwdqxl/p/8998178.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!