401. Binary Watch

最新推荐文章于 2022-12-08 12:55:15 发布

原创最新推荐文章于 2022-12-08 12:55:15 发布 · 485 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

本文介绍了LeetCode上的二进制手表问题，该问题要求根据指定数量的亮灯LED数，返回所有可能的时间表示。文章详细解释了如何通过穷举法解决此问题，并提供了一个Java实现的例子。

原题网址：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".

方法：穷举法。

public class Solution {
    private int bits(int n) {
        int count = 0;
        while (n > 0) {
            count++;
            n -= n & -n;
        }
        return count;
    }
    public List<String> readBinaryWatch(int num) {
        List<String> results = new ArrayList<>();
        for(int i = 0; i < 12; i++) {
            for(int j = 0; j < 60; j++) {
                if (bits(i) + bits(j) == num) {
                    results.add(i + ":" + (j < 10 ? "0" + j : j));
                }
            }
        }
        return results;
    }
}