字节 找出最近时间(回溯) C++ 2021-07-17

输入一个现在时间例如 19：12
输出距离它最近的时间（在19：12之后，按照现实生活来） 19：21
时间组成只能用输入的几个数字组成，每个数字可以重复使用
如果是19：11则代表到了第二天，则距离当前时间19：12更久了

#include <bits/stdc++.h>

using namespace std;

class Solution
{
public:
    string findNextTime(string& s)
    {
        vector<int> s2i;
        for (auto x : s)
        {
            if (x != ':')
                s2i.push_back(x - '0');
        }
        vector<int> temp_s2i(s2i);
        sort(s2i.begin(), s2i.end());
        // for (int x : s2i)
        //     cout << x << " ";
        // cout << endl;

        vector<bool> used(s2i.size(), 0);
        backTracking(s2i, used);

        int time_position = 0;
        time_position = minDisTime(result, temp_s2i);

        string str;
        for (int i = 0; i < result[time_position].size(); i++)
        {
            if (str.size() == 2)
                str.append(":");
            str.append(1, result[time_position][i] + '0'); 
        }
            
        return str;
    }
    int minDisTime(vector<vector<int>>& nums, vector<int>& temp_s2i);
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTracking(vector<int>& s2i, vector<bool>& used);
    
};
//回溯找出满足条件的时间组合
inline void Solution::backTracking(vector<int>& s2i, vector<bool>& used)
{
    if (path.size() == 4)
    {
        result.push_back(path);
        return;
    }

    for (int i = 0; i < s2i.size();i++)
    {
        if (i > 0 && s2i[i] == s2i[i - 1] && used[i - 1] == false)
            continue;
        if (path.size() == 0 && s2i[i] > 2 || 
            (path.size() == 1 && (path[0] == 2 && s2i[i] > 4)) || (path.size() == 2 && s2i[i] > 5))
            continue;
        path.push_back(s2i[i]);
        used[i] = true;
        backTracking(s2i, used);
        used[i] = false;
        path.pop_back();
    }
}

//在nums中找出第一个比temp_s2i大的值的位置 nums有序
inline int Solution::minDisTime(vector<vector<int>>& nums, vector<int>& temp_s2i)
{
    int factor1 = 1;
    int time1 = 0;
    for (int i = temp_s2i.size() - 1; i >= 0; i--)
    {
        time1 += temp_s2i[i] * factor1;
        factor1 *= 10;
    }
    // cout << "time1: " << time1 << endl;
    int factor = 1;
    // int time0 = 0;
    // for (int i = nums[0].size() - 1; i >= 0; i--)
    // {
    //     factor = 1;
    //     time0 += nums[0][i] * factor;
    //     factor *= 10;
    // }
    // cout << "time0: " << time0 << endl;
    for (int j = 1; j < nums.size(); j++)
    {
        factor = 1;
        int time = 0;
        for (int i = nums[j].size() - 1; i >= 0; i--)
        {
            time += nums[j][i] * factor;
            factor *= 10;
        }
        if (time > time1)
        {
            // return time;
            return j;
        }
    }
    // return time0;
    return 0;
}

int main()
{
    Solution* solution = new(Solution);
    string s;
    cin >> s;
    string str;
    str = solution->findNextTime(s);
    cout << str << endl;
    return 0;
}