[leetcode] 401. Binary Watch 解题报告

最新推荐文章于 2022-08-12 22:00:58 发布

原创最新推荐文章于 2022-08-12 22:00:58 发布 · 3.7k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #DFS

leetcode 同时被 2 个专栏收录

404 篇文章

订阅专栏

DFS

59 篇文章

订阅专栏

本文介绍了一道经典的二进制问题——二进制手表，通过深度优先搜索（DFS）算法来找出所有可能的时间表示方式。针对不同数量的LED灯亮起情况，详细解释了如何递归地遍历所有可能性，并确保输出符合实际时间格式。

题目链接：https://leetcode.com/problems/binary-watch/

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".

思路：基本还是一道DFS的题目，分别在小时和分钟上做DFS，给定几个灯亮，然后把这些亮的灯枚举分给小时和分钟．需要注意的是剪枝，即小时必须小于１２，分钟小于６０．然后将小时和分钟组合即可．还有一个需要注意的是如果分钟只有１位数，还要补０．

代码如下：

class Solution {
public:
    void DFS(int len, int k, int curIndex, int val, vector<int>& vec)
    {
        if(k==0 && len==4 && val < 12) vec.push_back(val);
        if(k==0 && len==6 && val < 60) vec.push_back(val);
        if(curIndex == len || k == 0) return;
        DFS(len, k, curIndex+1, val, vec);
        val += pow(2, curIndex), k--, curIndex++;
        DFS(len, k, curIndex, val, vec);
    }
    
    vector<string> readBinaryWatch(int num) {
        vector<string> ans;
        for(int i = max(0, num-6); i <= min(4, num); i++)
        {
            vector<int> vec1, vec2;
            DFS(4, i, 0, 0, vec1), DFS(6, num-i, 0, 0, vec2);
            for(auto val1: vec1)
                for(auto val2: vec2) 
                {
                    string str = (to_string(val2).size()==1?"0":"") + to_string(val2);
                    ans.push_back(to_string(val1)+":"+ str);
                }
        }
        return ans;
    }
};