LeetCode 401. Binary Watch
撰写于 20171103 修改于 20171107 分类 LeetCode
Question
A binary watch has 4 LEDs on the top which represent the hours (011), and the 6 LEDs on the bottom represent the minutes (059).
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 nonnegative 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”.
Solution
Since there are 10 LEDs. So from the upleft to the bottom right, each item has indexed from 0 to 9. We can apply backtracking to tackle this problem. And for backtracking, one must know where is the terminal state and how to back to the previous state, which is of great significance.
Accepted Code

