2019年4月19日
[LeetCode] 868. Binary Gap 二进制间隙
摘要： Given a positive integer , find and return the longest distance between two consecutive 1's in the binary representation of . If there aren't two cons 阅读全文
posted @ 2019-04-19 22:52 Grandyang 阅读(1844) 评论(1) 推荐(0) 编辑
Fork me on GitHub