Binary Watch:将十位二进制数转换成时间格式

最新推荐文章于 2022-07-07 12:22:17 发布

想改名的小雄鹿

最新推荐文章于 2022-07-07 12:22:17 发布

阅读量870

点赞数

分类专栏： Leetcode 文章标签： Java Leecode 组合二进制

本文链接：https://blog.csdn.net/u013300579/article/details/78167218

版权

Leetcode 专栏收录该内容

188 篇文章 1 订阅

订阅专栏

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

思路一：一共十位的0、1组合可能，那就直接递归穷举，注意剔除不合法时间与格式的转换。

class Solution {
	 public List<String> check(List<String> l){
	        ArrayList<String> list = new ArrayList<String>();
	        java.util.Iterator<String> it = l.iterator();
	        while(it.hasNext()){
	        	String s = it.next();
	            String in = "";
	            String pre = s.substring(0,4);
	            String suf = s.substring(4,s.length());
	            if(pre.equals("1111")||pre.equals("1101")||pre.equals("1110")||pre.equals("1100")){
	                it.remove();
	                continue;
	            }else{
	                int sum = 0;
	                int m = 1;
	                for(int i = pre.length()-1;i>=0;i--){
	                    if(pre.charAt(i)=='1'){
	                        sum+=m;
	                    }
	                    m*=2;
	                }	               
	             in+=sum+":";	                
	            }
	            if(suf.equals("111101")||suf.equals("111110")||suf.equals("111111")||suf.equals("111100")){
	                it.remove();
	                continue;
	            }else{
	                int sum = 0;
	                int m = 1;
	                for(int i = suf.length()-1;i>=0;i--){
	                    if(suf.charAt(i)=='1'){
	                        sum+=m;
	                    }
	                    m*=2;
	                }
	                if(sum<10){
	                    in+="0"+sum;
	                }else{
	                    in+=sum;
	                }
	            }
	            list.add(in);
	        }
	        return list;
	    }	    
	    public void dfs(int count,int n,List<String> l,String prefix,int index){
	        if(count==0){
	            l.add(prefix);
	            return;
	        }else if(count>n){
	            return;
	        }else{
	            for(int i = index;i<10;i++){
	            	String str = "";
	            	if(i==9){
	            		str = prefix.substring(0,i)+"1";
	            	}else{
	            		str = prefix.substring(0,i)+"1"+prefix.substring(i+1);
	            	}               
	                dfs(count-1,n,l,str,i+1);
	            }
	           
	        }
	    }	    
	    public List<String> readBinaryWatch(int num) {
	        ArrayList<String> list =new ArrayList<String>();
	        dfs(num,num,list,"0000000000",0);
	        return check(list);
	    }	    	    
}

思路二：上面写的又臭又长，小时的范围为0-11，分钟的范围为0-59，所以嵌套循环直接判断即可。

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