LeetCode 401 Binary Watch (状态压缩)

最新推荐文章于 2023-06-21 20:00:00 发布

_TCgogogo_

最新推荐文章于 2023-06-21 20:00:00 发布

阅读量1.7k

点赞数

分类专栏： Leetcode Easy LeetCode 文章标签： leetcode 状态压缩

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52619938

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Easy

48 篇文章 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".

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

题目分析：状态压缩

我写的渣渣代码 4ms

public class Solution {
    
    public final int hTime[] = {1, 2, 4, 8};
    public final int mTime[] = {1, 2, 4, 8, 16, 32};
    
    public int calOne(int num) {
        int ans = 0;
        while(num != 0) {
            ans += (num & 1);
            num >>= 1;
        }
        return ans;
    }
    
    public List<String> readBinaryWatch(int num) {
        List<String> ans = new ArrayList<>();
        int all = 1 << 10;
        for (int i = 0; i < all; i ++) {
            if (calOne(i & (all - 1)) != num) {
                continue;
            }
            int h = (i & 15);
            int m = (i & 1008);
            Integer hnum = new Integer(0);
            Integer mnum = new Integer(0);
            for (int j = 0; j < 4; j ++) {
                if (((1 << j) & h) != 0) {
                    hnum += hTime[j];
                }
            }
            for (int j = 4; j < 11; j ++) {
                if (((1 << j) & m) != 0) {
                    mnum += mTime[j - 4];
                }
            }
            if (mnum < 60 && hnum < 12) {
                if (mnum < 10) {
                    ans.add(hnum.toString() + ":0" + mnum.toString());
                }
                else {
                    ans.add(hnum.toString() + ":" + mnum.toString());
                }
            }
        }
        return ans;
    }
}

Discuss里大神的代码，不过速度慢了点，跑了20+

public class Solution {
   public List<String> readBinaryWatch(int num) {
        List<String> ans = new ArrayList<>();
        for (int h = 0; h < 12; h ++)
            for (int m = 0; m < 60; m ++)
                if (Integer.bitCount((h << 6) + m) == num)
                    ans.add(String.format("%d:%02d", h, m));
        return ans;        
    }
}