前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >LeetCode 401 Binary Watch

LeetCode 401 Binary Watch

作者头像
Yano_nankai
发布2018-10-08 10:34:18
1.2K0
发布2018-10-08 10:34:18
举报
文章被收录于专栏:二进制文集

题目描述

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:

代码语言:javascript
复制
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:

代码语言:javascript
复制
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".

题目分析

题目可以抽象为:将n个名额分配给两组数,每一组数1的位置随机,但是都有限制;求所有满足要求的集合。

代码

代码语言:javascript
复制
public List<String> readBinaryWatch(int num) {
    List<String> result = new ArrayList<>();
    int[] hour = {8, 4, 2, 1};
    int[] minute = {32, 16, 8, 4, 2, 1};
    for(int i = 0; i <= num; i++) {
        List<Integer> hours = gen(hour, i);
        List<Integer> minutes = gen(minute, num - i);
        for(int h : hours) {
            if(h > 11) continue;
            for(int m : minutes) {
                if(m > 59) continue;
                result.add(h + ":" + (m < 10 ? "0" : "") + m);
            }
        }
    }
    
    return result;
}

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

private void robot(int[] nums, int count, int pos, int out, List<Integer> res) {
    if(count == 0) {
        res.add(out);
        return;
    }
    for(int i = pos; i < nums.length; i++) {
        robot(nums, count - 1, i + 1, out + nums[i], res);
    }
}
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2017.12.10 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 题目描述
  • 题目分析
  • 代码
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档