LeetCode | 401. Binary Watch

最新推荐文章于 2024-10-29 22:44:45 发布

1LOVESJohnny

最新推荐文章于 2024-10-29 22:44:45 发布

阅读量168

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法 Binary Watch

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/121066979

版权

LeetCode 专栏收录该内容

285 篇文章 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 below binary watch reads “4:51”.
在这里插入图片描述

Given an integer turnedOn which represents the number of LEDs that are currently on, return all possible times the watch could represent. You may return the answer in any order.

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

Example 1:

Input: turnedOn = 1
Output: [“0:01”,“0:02”,“0:04”,“0:08”,“0:16”,“0:32”,“1:00”,“2:00”,“4:00”,“8:00”]

Example 2:

Input: turnedOn = 9
Output: []

Constraints:

0 <= turnedOn <= 10

.

代码

class Solution {
public:
    vector<string> readBinaryWatch(int num) {
        vector<string> res;
        for(int i = 0; i < 12; i++)
        {
            for(int j = 0; j<60; j++)
            {
                if(bitset<10>(i << 6 | j).count() == num)
                    res.emplace_back(to_string(i) + (j < 10 ? ":0" : ":") + to_string(j));
            }
        }
        return res;
    }
};