The time complexity is O(n), and I'd like to know if this approach is in any way efficient in terms of memory, or is there any scope of improvements with this? Thanks for your time.
The complexity is O(n), and I'd like to know if this approach is in any way efficient in terms of memory, or any scope of improvements with this? Thanks for your time.
The time complexity is O(n), and I'd like to know if this approach is in any way efficient in terms of memory, or is there any scope of improvements with this? Thanks for your time.
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
1001and contains a binary gap of length 2. The number 529 has binary representation1000010001and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation10100and contains one binary gap of length 1. The number 15 has binary representation1111and has no binary gaps. The number 32 has binary representation100000and has no binary gaps.
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
1001and contains a binary gap of length 2. The number 529 has binary representation1000010001and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation10100and contains one binary gap of length 1. The number 15 has binary representation1111and has no binary gaps. The number 32 has binary representation100000and has no binary gaps.
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
1001and contains a binary gap of length 2. The number 529 has binary representation1000010001and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation10100and contains one binary gap of length 1. The number 15 has binary representation1111and has no binary gaps. The number 32 has binary representation100000and has no binary gaps.
The complexity is O(n), and I'd like to know if this approach is in any way efficient than other ones in terms of memory, or any scope of improvements with this? Thanks for your time.
The complexity is O(n), and I'd like to know if this approach is in any way efficient than other ones in terms of memory, or any scope of improvements with this? Thanks for your time.
The complexity is O(n), and I'd like to know if this approach is in any way efficient in terms of memory, or any scope of improvements with this? Thanks for your time.