JAVA解Leetcode 401题 Binary Watch, faster than 100.00% of Java online submissions

题目描述

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

这道题在LeetCode上标注的是简单题，初次拿到这道题开始怀疑自己的智商（真的，简单，吗？）看到大佬的答案后的我：妙啊！

问题解答

Runtime: 0 ms, faster than 100.00% of Java online submissions for Binary Watch.
Memory Usage: 37.5 MB, less than 89.36% of Java online submissions for Binary Watch.

class Solution {
    List<String> timeList = new ArrayList<String>();
    public List<String> readBinaryWatch(int num) {
        for (int h = 0; h < 12; h++){
            for (int m = 0; m < 60; m++){
                if(bitCount(h) + bitCount(m) == num)
                    timeList.add(parseWatch(h,m));
            }
        }
        return timeList;
    }
    
    //计算二进制中1的个数
    public int bitCount(int n){
        int count = 0;
        while(n != 0){
            n = n & (n-1);
            count++;
        }
        return count;
    }
    
    public String parseWatch(int hour, int minute) {
        StringBuilder sb = new StringBuilder();
        sb.append(hour).append(":");
        if(minute < 10) {
            sb.append(0);
        }
        sb.append(minute);
        return sb.toString();
    }
}