401. 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".

这种解法利用到了bitset这个类，能够将任意进制数转为二进制，并且又用到了Integer.bitCount()函数，用来统计1的个数。那么时针从0遍历到11，分针从0遍历到59，bitCount 方法是用来统计参数i转成2进制后有多少个1

public class Solution {
    public List<String> readBinaryWatch(int num) {
        List<String> res = new ArrayList<String>();
        for (int i=0; i<12; i++) {
            for (int j=0; j<60; j++) {
                if (Integer.bitCount(i) + Integer.bitCount(j) == num) {
                    String str1 = Integer.toString(i);
                    String str2 = Integer.toString(j);
                    res.add(str1 + ":" + (j<10? "0"+str2 : str2));
                }
            }
        }
        return res;
    }
}

　　上面的方法之因此那么简洁是由于用了bitset这个类，若是咱们不用这个类，那么应该怎么作呢？这个灯亮问题的本质其实就是在n个数字中取出k个，那么就跟以前的那道Combinations同样，咱们能够借鉴那道题的解法，那么思路是，若是总共要取num个，咱们在小时集合里取i个，算出和，而后在分钟集合里去num-i个求和，若是两个都符合题意，那么加入结果中便可，参见代码以下:

public class Solution {
    public List<String> readBinaryWatch(int num) {
        int[] nums1 = new int[]{8, 4, 2, 1}, nums2 = new int[]{32, 16, 8, 4, 2, 1};
        List<String> res = new ArrayList<String>();
        for (int i=0; i<=num; i++) {
            List<Integer> hours = getTime(nums1, i, 12);
            List<Integer> minutes = getTime(nums2, num-i, 60);
            for (int hour : hours) {
                for (int minute : minutes) {
                    res.add(hour + ":" + (minute<10? "0"+minute : minute));
                }
            }
        }
        return res;
    }
    
    public List<Integer> getTime(int[] nums, int count, int limit) {
        List<Integer> res = new ArrayList<Integer>();
        getTimeHelper(res, count, 0, 0, nums, limit);
        return res;
    }
    
    public void getTimeHelper(List<Integer> res, int count, int pos, int sum, int[] nums, int limit) {
        if (count == 0) {
            if (sum < limit)    
                res.add(sum);
            return;
        }
        for (int i=pos; i<nums.length; i++) {
            getTimeHelper(res, count-1, i+1, sum+nums[i], nums, limit);
        }
    }
}