【LeetCode】401. Binary Watch

问题描述

问题链接：https://leetcode.com/problems/binary-watch/#/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”.

我的代码

刚写回溯法还是不熟，在变量控制上错了好多次。好在最后自己调试出来了。

public class Solution {
    private List<String> result = new ArrayList<String>();
    public List<String> readBinaryWatch(int num) {
        /*
        思路是使用回溯法
        */
        int[] timeArr = new int[10];
        helper(timeArr,num,0,0,10);
        return result;
    }

    private void helper(int[] timeArr, int num, int curNum, int startPos, int N){
        if(curNum == num){// 找到一个解
            genTimeString(timeArr);
        }
        for(int i = startPos; i < N; i++){
            if(curNum < num){ // 只要比给定的1少就有希望
                timeArr[i] = 1;
                helper(timeArr,num,curNum+1,i + 1,N);
                timeArr[i] = 0;
            }

        }
    }

    private void genTimeString(int[] timeArr){
        int minute = 0;
        for(int i = 0; i <= 5; i++){
            if(timeArr[i] > 0){
                int mask = (1 << i);
                minute |= mask;
            }
        }
        if(minute >= 60){
            return;
        }
        int hour = 0;

        for(int i = 6; i < 10; i++){
            if(timeArr[i] > 0){
                int mask = (1 << (i-6));
                hour |= mask;
            }
        }
        if(hour >= 12){
            return;
        }

        result.add(String.format("%d:%02d",hour,minute));
    }
}

打败了22.90%的Java代码。

讨论区

Simple Python+Java

链接地址：https://discuss.leetcode.com/topic/59374/simple-python-java

这，这，这，人根本不用回溯法嘛，哭

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

3ms Java Solution Using Backtracking and Idea of “Permutation and Combination”

链接地址：https://discuss.leetcode.com/topic/59494/3ms-java-solution-using-backtracking-and-idea-of-permutation-and-combination

嗯，这个。。。big god, plz receive my knees

public class Solution {
    public List<String> readBinaryWatch(int num) {
        List<String> res = new ArrayList<>();
        int[] nums1 = new int[]{8, 4, 2, 1}, nums2 = new int[]{32, 16, 8, 4, 2, 1};
        for(int i = 0; i <= num; i++) {
            List<Integer> list1 = generateDigit(nums1, i);
            List<Integer> list2 = generateDigit(nums2, num - i);
            for(int num1: list1) {
                if(num1 >= 12) continue;
                for(int num2: list2) {
                    if(num2 >= 60) continue;
                    res.add(num1 + ":" + (num2 < 10 ? "0" + num2 : num2));
                }
            }
        }
        return res;
    }

    private List<Integer> generateDigit(int[] nums, int count) {
        List<Integer> res = new ArrayList<>();
        generateDigitHelper(nums, count, 0, 0, res);
        return res;
    }

    private void generateDigitHelper(int[] nums, int count, int pos, int sum, List<Integer> res) {
        if(count == 0) {
            res.add(sum);
            return;
        }

        for(int i = pos; i < nums.length; i++) {
            generateDigitHelper(nums, count - 1, i + 1, sum + nums[i], res);    
        }
    }
}