zoukankan      html  css  js  c++  java
  • 1.求整数最大的连续0的个数 BinaryGap Find longest sequence of zeros in binary representation of an integer.

    求整数最大的连续0的个数 

    A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N. For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps. Write a function: class Solution { public int solution(int N); } that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap. For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5. Assume that: N is an integer within the range [1..2,147,483,647]. Complexity: expected worst-case time complexity is O(log(N)); expected worst-case space complexity is O(1).
    package com.codility;
    public class Test01 {
        public int solution(int N) {
            if(N<=0){
                return 0;
            }
            String str = Integer.toBinaryString(N);
            int size = str.length();
            int count=0;
            int max = 0;
            for(int i=0;i<size;i++){
                String str01 = str.substring(i, i+1);
                if(str01.equals("1")){
                    if(count>0){
                        max = Math.max(count, max);
                    }
                    count = 0;
                }
                if(str01.equals("0")){
                    count ++;
                }
            }
            return max;
        }
        public static void main(String[] args) {
            String str = Integer.toBinaryString(20);
            System.out.println(str);
    //        System.out.println(str.substring(0, 1));
            Test01 t01 = new Test01();
            System.out.println(t01.solution(5));
            System.out.println(t01.solution(20));
            System.out.println(t01.solution(529));
        }
    }
  • 相关阅读:
    vue子组件获取父组件方法
    css hack
    【Educational Codeforces Round 87 (Rated for Div. 2)】前4题
    【某次ks】20200512
    NoI Online 2反思
    RMQ&LCA
    杂谈
    高手训练矩乘T3
    0118ACM自闭赛
    网络流初步学习笔记
  • 原文地址:https://www.cnblogs.com/stono/p/6412987.html
Copyright © 2011-2022 走看看