Problem:
Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N.
If there aren't two consecutive 1's, return 0.
Example 1:
Input: 22
Output: 2
Explanation:
22 in binary is 0b10110.
In the binary representation of 22, there are three ones, and two consecutive pairs of 1's.
The first consecutive pair of 1's have distance 2.
The second consecutive pair of 1's have distance 1.
The answer is the largest of these two distances, which is 2.
Example 2:
Input: 5
Output: 2
Explanation:
5 in binary is 0b101.
Example 3:
Input: 6
Output: 1
Explanation:
6 in binary is 0b110.
Example 4:
Input: 8
Output: 0
Explanation:
8 in binary is 0b1000.
There aren't any consecutive pairs of 1's in the binary representation of 8, so we return 0.
Note:
- 1 <= N <= 10^9
思路:
Solution (C++):
int binaryGap(int N) {
int res = 0, d = -32;
while (N) {
if (N%2) {
res = max(res, d);
d = 0;
}
N /= 2;
++d;
}
return res;
}
性能:
Runtime: 0 ms Memory Usage: 6 MB
思路:
Solution (C++):
int peakIndexInMountainArray(vector<int>& A) {
for (int i = 0; i < A.size()-1; ++i) {
if (A[i] > A[i+1]) return i;
}
return -1;
}
性能:
Runtime: 12 ms Memory Usage: 7.4 MB
原文链接: https://www.cnblogs.com/dysjtu1995/p/12741705.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍;
也有高质量的技术群,里面有嵌入式、搜广推等BAT大佬
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/343603
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!