[LeetCode 401] Binary Watch

最新推荐文章于 2024-10-13 00:45:51 发布

ExcitedZhang

最新推荐文章于 2024-10-13 00:45:51 发布

阅读量97

点赞数

分类专栏： LeetCode 文章标签： LeetCode 递归数组

本文链接：https://blog.csdn.net/ExcitedZhang/article/details/89602134

版权

LeetCode 专栏收录该内容

118 篇文章 0 订阅

订阅专栏

A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).

Each LED represents a zero or one, with the least significant bit on the right.

For example, the above binary watch reads "3:25".

Given a non-negative integer n which represents the number of LEDs that are currently on, return all possible times the watch could represent.

Example:

Input: n = 1
Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]

Note:

The order of output does not matter.
The hour must not contain a leading zero, for example "01:00" is not valid, it should be "1:00".
The minute must be consist of two digits and may contain a leading zero, for example "10:2" is not valid, it should be "10:02".

分析

这道题跟Permutations那道题目比较类似，都是属于找到各种组合。不过本题的点在于要在两个Array中寻找可能的组合，然后在将他们拼接在一块。但是对于Hour和Minute的长度和大小的要求需要单独的进行处理。

本题也是使用了递归的办法去遍历不同的num的数字。其中hour的num要求不能超过3个，minute的要求不能超过5个，不然一定不是一个合法的时间。

Code

class Solution {
public:
    vector<string> readBinaryWatch(int num) {
        vector<string> res;
        
        int hoursArray[] = {1, 2, 4, 8};
        int minutesArray[] = {1, 2, 4, 8, 16, 32};
        vector<int> hours(hoursArray, hoursArray + 4);
        vector<int> minutes(minutesArray, minutesArray + 6);
        
        for (int i = 0; i <= 3 && i <= num; i ++)
        {
            if (num - i > 5)
                continue;
            vector<int> hour;
            vector<int> minute;
            getTime(hours, i, 0, hour);
            getTime(minutes, num-i, 0, minute);
            for (int m = 0; m < hour.size(); m ++)
            {
                for (int n = 0; n < minute.size(); n ++)
                {
                    if (hour[m] > 11 || minute[n] > 59)
                        continue;
                    string ho = to_string(hour[m]);
                    string mi = to_string(minute[n]);
                    if (mi.size() < 2)
                        mi.insert(mi.begin(), '0');
                    res.push_back(ho + ":" + mi);
                }
            }         
        }
        return res;
    }
    
    void getTime(vector<int> nums, int num, int total, vector<int>& res)
    {
        if (num == 0)
        {
            res.push_back(total);
            return;
        }
        
        for (int i = 0; i < nums.size() - num + 1; i ++)
        {
            vector<int> tmpNum(nums.begin() + i + 1, nums.end());
            int tmpTotal = total + nums[i];
            getTime(tmpNum, num-1, tmpTotal, res);
        }
        return;
    }
};

运行效率

Runtime: 4 ms, faster than 100.00% of C++ online submissions for Binary Watch.

Memory Usage: 9 MB, less than 34.61% of C++ online submissions for Binary Watch.