401-二进制表

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/LaputaFallen/article/details/79968750

Description

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

问题描述

一个二进制表在顶部有四个灯,代表小时(0 - 11),在底部有六个灯,代表分钟(0 - 59).
每个灯的明灭代表最低位的1或者0

给定整数n,代表当前亮着的灯的个数,返回表代表的所有可能的时间


解法

class Solution {
    public List<String> readBinaryWatch(int num) {
        List<String> res = new ArrayList<>();

        for (int h = 0; h < 12; h ++) {
            for (int m = 0; m < 60; m ++) {
                //注意这里的技巧,直接用位计数,得到位为1的个数
                if (Integer.bitCount(h) + Integer.bitCount(m) == num) {
                    if (m < 10) {
                        res.add(h + ":" + "0" + m);
                    } else {
                        res.add(h + ":" + m);
                    }
                }
            }
        }

        return res;
    }
}
阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页