문자열 인덱스
-
진수변환과 문자열 인덱스를 통한 알고리즘Algorithm 2021. 6. 22. 14:15
아래 문제는 코딜리티에서 제공하는 Binary Gap의 문제입니다🧑🏻💻 문제 제시 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 ..