401. Binary Watch

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

分析： 链接https://discuss.leetcode.com/topic/59309/simple-java-ac-solution-with-explanation

思想：用一个数组vector<int> a(10, 0)表示小时和分钟的各个位。这里a[0]....a[3]分别代表1小时，2小时，4小时，8小时，

a[i]只能取0,1;a[4].....a[9]分别代表分钟的1,2,......32。根据a,就可以得到时间。

有k个灯亮，表明只能从数组a中选取k个树，组成时间，用深度递归。

这里再得到由k个元素组成的时间时，要判断小时在12之内，分在60之内，否则解是无效解。

class Solution {
    //判断时间是否是有效时间
    bool istrue(vector
   
   
    
     & a)
    {
        int min,hour;
        min=hour=0;
        for(int i=0;i<4;i++)
        hour+=(1<
    
    
     
      & a)
    {
        int min,hour;
        min=hour=0;
        for(int i=0;i<4;i++)
        hour+=(1<
     
     
      
       a, vector
      
      
       
        & r, string & s)
   {
       
       if(k==num)//亮的灯==num，返回
       {
           if(istrue(a))
           {
           s=print(a);
           r.push_back(s);
           }
           return;
       }else 
       if(i==a.size())
       return;
       else
       {
           //a[i]只有两种取值0,1
           a[i]=0;
           DFS(i+1,k,num,a,r,s);//a[i]=0,表示灯未亮，k不变
           a[i]=1;
           DFS(i+1,k+1,num,a,r,s);a[i]=1,表示灯亮，k+1，
           //递归结束后，重设a[i]=0
           a[i]=0;
       }
   }
public:
    vector
       
       
         readBinaryWatch(int num) { vector 
        
          r; string s; vector 
         
           a(10,0); DFS(0,0,num,a,r,s); return r; } };