2017年12月5日
LeetCode 338. Counting Bits
摘要： 位运算 x&x-1 zero out the least significant 1 The first solution is to use the popCount method which could count the 1 bits for one specific number. The 阅读全文
posted @ 2017-12-05 22:05 nina阿瑶 阅读(159) 评论(0) 推荐(0) 编辑