[LeetCode]--401. Binary Watch（递归有点懵）

杜鲁门

于 2016-10-17 17:47:04 发布

阅读量876

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode 递归 Binary 算法

本文链接：https://blog.youkuaiyun.com/bug_moving/article/details/52840410

115 篇文章 ¥9.90 ¥99.00

订阅专栏

126 篇文章

订阅专栏

这篇博客探讨了LeetCode中第401题——二进制手表的问题。题目要求根据开启的LED数量，找出所有可能显示的时间。文章介绍了如何通过递归方法解决此问题，并强调小时数不应包含前导零，分钟必须是两位数，可能含有前导零。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 examp

了解本专栏