//url:https://leetcode.com/problems/binary-gap/description/
class Solution {
public:
int binaryGap(int N) {
int x=1;
int sum=x;
int findIndex=-1;
int index=1;
if(N&x){
findIndex=index;
}
int maxDistance=0;
while(sum(index-findIndex)?maxDistance:(index-findIndex);
findIndex=index;
}
}
}
return maxDistance;
}
};
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2018/07/23/leetcode-868-binary-gap/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!