LeetCode #681 - Next Closest Time

题目描述：

Given a time represented in the format "HH:MM", form the next closest time by reusing the current digits. There is no limit on how many times a digit can be reused.

You may assume the given input string is always valid. For example, "01:34", "12:09" are all valid. "1:34", "12:9" are all invalid.

Example 1:

Input: "19:34"

Output: "19:39"

Explanation: The next closest time choosing from digits 1, 9, 3, 4, is 19:39, which occurs 5 minutes later.  It is not 19:33, because this occurs 23 hours and 59 minutes later.

Example 2:

Input: "23:59"

Output: "22:22"

Explanation: The next closest time choosing from digits 2, 3, 5, 9, is 22:22. It may be assumed that the returned time is next day's time since it is smaller than the input time numerically.

class Solution {
public:
    string nextClosestTime(string time) {
        string result;
        string cur;
        DFS(time, 0, cur, result);
        //当time全部数字都是相同的时候，没有下一个时间，需要直接返回time
        if(result.size()==0) return time;
        else return result;
    }
    
    void DFS(string time, int i, string cur, string& result)
    {
        if(i==5)
        {
            if(cur==time||atoi(cur.substr(0,2).c_str())>23||atoi(cur.substr(3,2).c_str())>59) return;
            else if(result.size()==0) result=cur;
            else if(minutes(time,cur)<minutes(time,result)) result=cur;
            return;
        }
        else if(i==2) DFS(time,i+1,cur+':',result);
        else
        {
            for(int j=0;j<time.size();j++) 
                if(time[j]!=':') DFS(time,i+1,cur+time[j],result);
        }
    }
    
    //计算s2-s1的分钟数，若s2更小,则认为是下一天
    int minutes(string s1, string s2)
    {
        int hour1=atoi(s1.substr(0,2).c_str());
        int minute1=atoi(s1.substr(3,2).c_str());
        int hour2=atoi(s2.substr(0,2).c_str());
        int minute2=atoi(s2.substr(3,2).c_str());        
        int result=(hour2-hour1)*60+minute2-minute1;
        if(result<0) result+=24*60;
        return result;
    }
};